Combinatorial constructions of weight bases: the Gelfand-Tsetlin basis

MaRDI QIDQ2380466zbMATH OpenFDO

Authors Patricia Hersh, Cristian Lenart

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0804.4719, https://eudml.org/doc/232660, http://www.emis.de/journals/EJC/Volume_17/Abstracts/v17i1r33.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10)

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.

Review text

Summary: 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 sln, the celebrated Gelfand-Tsetlin basis is the only such basis known. Using the setup of supporting graphs developed by Donnelly, we present a new interpretation and a simple combinatorial proof of the Gelfand-Tsetlin formulas based on a rational function identity (all the known proofs use more sophisticated algebraic tools). A constructive approach to the Gelfand-Tsetlin formulas is then given, based on a simple algorithm for solving certain equations on the lattice of semistandard Young tableaux. This algorithm also implies certain extremal properties of the Gelfand-Tsetlin basis.

Recommendations

• scientific article; zbMATH DE number 1504593
• Gelfand-Tsetlin-type weight bases for all special linear Lie algebra representations corresponding to skew Schur functions
• Gelfand-Tsetlin bases for classical Lie algebras
• Extremal properties of bases for representations of semisimple Lie algebras
• Weight bases of Gelfand-Tsetlin type for representations of classical Lie algebras

Cited in

(9)

• Extremal properties of bases for representations of semisimple Lie algebras
• Comparison of Gelfand-Tsetlin bases for alternating and symmetric groups
• Construction of the Gelfand-Tsetlin basis for unitary principal series representations of the algebra \(sl_n(\mathbb{C})\)
• Solitary and edge-minimal bases for representations of the simple Lie algebra \(G_2\)
• Gelfand-Tsetlin-type weight bases for all special linear Lie algebra representations corresponding to skew Schur functions
• Gelfand-Tsetlin bases for classical Lie algebras
• Weight bases of Gelfand-Tsetlin type for representations of classical Lie algebras
• A relationship between Gelfand-Tsetlin bases and Chari-Loktev bases for irreducible finite dimensional representations of special linear Lie algebras
• Explicit constructions of some infinite families of finite-dimensional irreducible representations of the type \(\mathsf{E}_6\) and \(\mathsf{E}_7\) simple Lie algebras

This page was built for publication: Combinatorial constructions of weight bases: the Gelfand-Tsetlin basis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380466)