The Schur–Weyl Graph and Thoma’s Theorem
- 1 July 2021
- journal article
- research article
- Published by Pleiades Publishing Ltd in Functional Analysis and Its Applications
- Vol. 55 (3) , 198-209
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.Keywords
This publication has 11 references indexed in Scilit:
- Комбинаторное кодирование схем Бернулли и асимптотика таблиц Юнга2020
- Три теоремы о единственности меры Планшереля c разных позиций2019
- Representations of the Infinite Symmetric Group2016
- Jeu de taquin dynamics on infinite Young tableaux and second class particlesThe Annals of Probability, 2015
- Robinson--Schensted--Knuth Algorithm, Jeu de Taquin, and Kerov--Vershik Measures on Infinite TableauxSIAM Journal on Discrete Mathematics, 2014
- Asymptotic Representation Theory of the Symmetric Group and its Applications in Analysis2003
- Enumerative Combinatorics1999
- Hook young diagrams with applications to combinatorics and to representations of Lie superalgebrasAdvances in Mathematics, 1987
- The Characters of the Infinite Symmetric Group and Probability Properties of the Robinson–Schensted–Knuth AlgorithmSIAM Journal on Algebraic Discrete Methods, 1986
- Die unzerlegbaren, positiv-definiten Klassenfunktionen der abz hlbar unendlichen, symmetrischen GruppeMathematische Zeitschrift, 1964