Effective reduction of Goresky-Kottwitz-MacPherson graphs
Cochet, Charles
Experiment. Math., Tome 14 (2005) no. 1, p. 133-144 / Harvested from Project Euclid
Text on Project Euclid
PDF
Alt PDF
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.
Publié le : 2005-05-14
Classification:  Hamiltonian manifold,  symplectic reduction,  quantization,  cohomology,  $K$-theory,  GKM graph,  Cayley graph,  Johnson graph,  graph reduction,  53D20,  68R10 
@article{1128100126,
     author = {Cochet, Charles},
     title = {Effective reduction of Goresky-Kottwitz-MacPherson graphs},
     journal = {Experiment. Math.},
     volume = {14},
     number = {1},
     year = {2005},
     pages = { 133-144},
     language = {en},
     url = {http://dml.mathdoc.fr/item/1128100126}
}

Cochet, Charles. Effective reduction of Goresky-Kottwitz-MacPherson graphs. Experiment. Math., Tome 14 (2005) no. 1, pp.  133-144. http://gdmltest.u-ga.fr/item/1128100126/