|
This article is cited in 1 scientific paper (total in 1 paper)
The Schur–Weyl graph and Thoma's theorem.
A. M. Vershikabc, N. V. Tsilevicha a St. Petersburg Department of Steklov Mathematical Institute of Russian Academy of Sciences
b Saint Petersburg State University
c Institute for Information Transmission Problems of the Russian Academy of Sciences (Kharkevich Institute), Moscow
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:
Schur–Weyl graph, RSK algorithm, Thoma's theorem, central measures.
Received: 17.06.2021 Revised: 17.06.2021 Accepted: 21.06.2021
Citation:
A. M. Vershik, N. V. Tsilevich, “The Schur–Weyl graph and Thoma's theorem.”, Funktsional. Anal. i Prilozhen., 55:3 (2021), 26–41; Funct. Anal. Appl., 55:3 (2021), 198–209
Linking options:
https://www.mathnet.ru/eng/faa3917https://doi.org/10.4213/faa3917 https://www.mathnet.ru/eng/faa/v55/i3/p26
|
Statistics & downloads: |
Abstract page: | 276 | Full-text PDF : | 82 | References: | 35 | First page: | 19 |
|