Papers
Topics
Authors
Recent
Search
2000 character limit reached

Bounds of Gelfand-Tsetlin multiplicities and tableaux realizations of Verma modules

Published 19 Nov 2018 in math.RT | (1811.07992v2)

Abstract: We introduce the notion of essential support of a simple Gelfand-Tsetlin $\mathfrak{gl}_n$-module as an important tool towards understanding the character formula of such module. This support detects the weights in the module having maximal possible Gelfand-Tsetlin multiplicities. Using combinatorial tools we describe the essential supports of the simple socles of the universal tableaux modules. We also prove that every simple Verma module appears as a socle of a universal tableaux module and hence obtain a description of the essential supports of all simple Verma modules. As a consequence, we prove the Strong Futorny-Ovsienko Conjecture on the sharpness of the upper bounds of the Gelfand-Tsetlin multiplicities. In addition we give a very explicit description of the support and essential support of the simple singular Verma module $M(-\rho)$

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.