Papers
Topics
Authors
Recent
Search
2000 character limit reached

Combinatorial construction of Gelfand-Tsetlin modules for $\mathfrak{gl}_n$

Published 23 Nov 2016 in math.RT | (1611.07908v5)

Abstract: We propose a new effective method of constructing explicitly Gelfand -Tsetlin modules for $\mathfrak{gl}_n$. We obtain a large family of simple modules that have a basis consisting of Gelfand-Tsetlin tableaux, the action of the Lie algebra is given by the Gelfand-Tsetlin formulas and with all Gelfand-Tsetlin multiplicities equal $1$. As an application of our construction we prove necessary and sufficient condition for the Gelfand and Graev's continuation construction to define a module which was conjectured by Lemire and Patera.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.