Effective Reduction of Goresky-Kottwitz-MacPherson Graphs

The Goresky-Kottwitz-MacPherson (GKM) graph is a combinatorial analogue of a compact connected symplectic manifold with a Hamiltonian action of a compact torus. This graph has been intensively studied by Guillemin and Zara, who discovered analogues in graph theory of classical results such as: sympl...

Full description

Saved in:
Bibliographic Details
Published inExperimental mathematics Vol. 14; no. 2; pp. 133 - 144
Main Author Cochet, Charles
Format Journal Article
LanguageEnglish
Published A.K. Peters 01.01.2005
A K Peters, Ltd
Subjects
53D20
68R10
Cayley graph
cohomology
GKM graph
graph reduction
Hamiltonian manifold
Johnson graph
K-theory
Primary 53D20, 68R10
quantization
symplectic reduction
Online AccessGet full text

Cover

More Information
Summary:The Goresky-Kottwitz-MacPherson (GKM) graph is a combinatorial analogue of a compact connected symplectic manifold with a Hamiltonian action of a compact torus. This graph has been intensively studied by Guillemin and Zara, who discovered analogues in graph theory of classical results such as: symplectic reduction and "quantization and reduction commute." In this paper, we describe the implementation of algorithms illustrating their results.
ISSN:1058-6458
1944-950X
DOI:10.1080/10586458.2005.10128921