Block characters of the symmetric groups
Alexander Gnedin, Vadim Gorin, Sergei Kerov

TL;DR
This paper characterizes block characters of finite symmetric groups, explores their connections to algebraic structures and limit shapes of Young diagrams, and extends the analysis to the infinite symmetric group and related groups.
Contribution
It identifies the extreme rays of the cone of block characters and relates them to descent representations, coinvariant algebra, and Thoma characters.
Findings
Identified the extreme rays of the cone of block characters.
Established relations between block characters and descent representations.
Derived limit shape theorems for random Young diagrams.
Abstract
Block character of a finite symmetric group S(n) is a positive definite function which depends only on the number of cycles in permutation. We describe the cone of block characters by identifying its extreme rays, and find relations of the characters to descent representations and the coinvariant algebra of S(n). The decomposition of extreme block characters into the sum of characters of irreducible representations gives rise to certain limit shape theorems for random Young diagrams. We also study counterparts of the block characters for the infinite symmetric group S(\infty) along with their connection to the Thoma characters of the infinite linear group GL(\infty,q) over a Galois field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Graph theory and applications
