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

Abstract

We introduce the notion of essential support of a simple Gelfand-Tsetlin gln-module as an attempt to understand the character formula of such module. This support detects the weights 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 the socle of a universal tableaux module. As a consequence, we prove the Strong Futorny-Ovsienko Conjecture on the sharpness of the upper bounds of the Gelfand-Tsetlin multiplicities. We also give a very explicit description of the support and essential support of the simple singular Verma module M(−ρ).