The Schur--Weyl graph and Thoma's theorem
Representation Theory
2021-07-20 v1
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.
Cite
@article{arxiv.2107.08415,
title = {The Schur--Weyl graph and Thoma's theorem},
author = {A. Vershik and N. Tsilevich},
journal= {arXiv preprint arXiv:2107.08415},
year = {2021}
}
Comments
19 pp. Ref.21