pith. machine review for the scientific record. sign in

arxiv: 1811.07992 · v2 · submitted 2018-11-19 · 🧮 math.RT

Recognition: unknown

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

Authors on Pith no claims yet
classification 🧮 math.RT
keywords modulesimpleessentialgelfand-tsetlinsupportvermamodulesmultiplicities
0
0 comments X
read the original 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)$

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.