Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Combinatorial construction of Gelfand-Tsetlin modules for $\mathfrak{gl}_n$ (1611.07908v5)

Published 23 Nov 2016 in math.RT

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

We haven't generated a summary for this paper yet.