Random strict partitions and random shifted tableaux
arXiv:1906.07937 · doi:10.1007/s00029-020-0535-2
Abstract
We study asymptotics of random shifted Young diagrams which correspond to a given sequence of reducible projective representations of the symmetric groups. We show limit results (Law of Large Numbers and Central Limit Theorem) for their shapes, provided that the representation character ratios and their cumulants converge to zero at some prescribed speed. Our class of examples includes uniformly random shifted standard tableaux with prescribed shape as well as shifted tableaux generated by some natural combinatorial algorithms (such as shifted Robinson-Schensted-Knuth correspondence) applied to a random input.
arXiv comment62 pages. Version 2: * changes to the structure of the paper, * in Section 3.2.2 the definition of the filtration on the algebra of the odd partitions was corrected (a missing minus sign was added), * a missing assumption to Lemma 3.6 that the map preserves the degree was added
References in corpus (12)
- Gaussian fluctuations of characters of symmetric groups and of Young diagrams
- Explicit combinatorial interpretation of Kerov character polynomials as numbers of permutation factorizations
- The uses of random partitions
- Braid moves in commutation classes of the symmetric group
- Gaussian fluctuations of Jack-deformed random Young diagrams
- Lectures on spin representation theory of symmetric groups
- Structure coefficients for Jack characters: approximate factorization property
- Asymptotics of Jack characters
- Asymptotic results for Representation Theory
- A Spin Analogue of Kerov Polynomials
- Linear versus spin: representation theory of the symmetric groups
- On random shifted standard Young tableaux and 132-avoiding sorting networks