Translator Disclaimer
2005 Effective reduction of Goresky-Kottwitz-MacPherson graphs
Charles Cochet
Experiment. Math. 14(2): 133-144 (2005).

Abstract

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.

Citation

Download Citation

Charles Cochet. "Effective reduction of Goresky-Kottwitz-MacPherson graphs." Experiment. Math. 14 (2) 133 - 144, 2005.

Information

Published: 2005
First available in Project Euclid: 30 September 2005

zbMATH: 1084.53067
MathSciNet: MR2169517

Subjects:
Primary: 53D20, 68R10

Rights: Copyright © 2005 A K Peters, Ltd.

JOURNAL ARTICLE
12 PAGES


SHARE
Vol.14 • No. 2 • 2005
Back to Top