The Schur--Weyl graph and Thoma's theorem

2021/07/18 by Vershik, A., Tsilevich, N. · 1 citation
#37C85 #FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.2107.08415

Abstract

We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the first applications of this graph, we give a new proof of the completeness of the list of discrete indecomposable characters of the infinite symmetric group.

Cited by

• Totally positive Toeplitz matrices: classical and modern

Related

• A combinatorial realization of Schur-Weyl duality via crystal graphs and dual equivalence graphs
• A diagram-like basis for the multiset partition algebra
• A central limit theorem for the characters of the infinite symmetric\n group and of the infinite Hecke algebra
• Dual graphs from noncommutative and quasisymmetric Schur functions
• Tropical Robinson-Schensted-Knuth correspondence and birational Weyl group actions