Resumen de Random strict partitions and random shifted tableaux

Sho Matsumoto, Piotr Sniady

• 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.