The Schur--Weyl graph and Thoma's theorem

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...

Full description

Saved in:
Bibliographic Details
Main Authors Vershik, A, Tsilevich, N
Format Journal Article
LanguageEnglish
Published 18.07.2021
Subjects
Mathematics - Representation Theory
Online AccessGet full text

Cover

More Information
Summary: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.
DOI:10.48550/arxiv.2107.08415