Combinatorial Constructions of Weight Bases: The Gelfand-Tsetlin Basis
Preprint
Abstract
This work is part of a project on weight bases for the irreducible representations of semisimple Lie algebras with respect to which the representation matrices of the Chevalley generators are given by explicit formulas. In the case of sl_n, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity. Some properties of the Gelfand-Tsetlin basis are derived via an algorithm for solving certain equations on the lattice of semistandard Young tableaux.Keywords
All Related Versions
This publication has 16 references indexed in Scilit:
- Solitary and edge-minimal bases for representations of the simple lie algebraDiscrete Mathematics, 2006
- Extremal Properties of Bases for Representations of Semisimple Lie AlgebrasJournal of Algebraic Combinatorics, 2003
- Constructions of representations of o(2n+1,C) that imply Molev and Reiner–Stanton lattices are strongly SpernerDiscrete Mathematics, 2003
- Explicit Constructions of the Fundamental Representations of the Symplectic Lie AlgebrasJournal of Algebra, 2000
- Symplectic Analogs of the Distributive Lattices L(m, n)Journal of Combinatorial Theory, Series A, 1999
- A Basis for Representations of Symplectic Lie AlgebrasCommunications in Mathematical Physics, 1999
- Crystal Graphs for Representations of the q-Analogue of Classical Lie AlgebrasJournal of Algebra, 1994
- Gelfand-Tsetlin basis for representations of YangiansLetters in Mathematical Physics, 1994
- Crystalizing theq-analogue of universal enveloping algebrasCommunications in Mathematical Physics, 1990
- Symplectic standard tableauxAdvances in Mathematics, 1979