Asymptotic results for Representation Theory
Dario De Stavola

TL;DR
This thesis explores asymptotic behaviors in representation theory of symmetric groups, including character limits, projective representations, and supercharacter measures, revealing new limit theorems and conjectures.
Contribution
It extends Kerov's asymptotic results, introduces positivity conjectures for projective characters, and establishes a limit shape for supercharacter distributions.
Findings
Proved central limit theorems for partial trace and sum of representations.
Established a law of large numbers for partial sums.
Proved a limit shape for random set partitions under superplancherel measure.
Abstract
Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in this thesis we consider three ramifications of asymptotic questions for random Plancherel distributed representations. First we recall irreducible characters of the symmetric group, which are indexed by integer partitions. We focus on the so called 'dual approach', in which the partition indexing a character is now considered to be the variable. We extend a famous result of Kerov on the asymptotic of Plancherel distributed characters by studying partial trace and partial sum of a representation matrix. We decompose each of these objects into a main term and a remainder, and in each case we prove a central limit theorem for the main term. We apply…
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
TopicsRandom Matrices and Applications · Advanced Algebra and Geometry · Advanced Combinatorial Mathematics
