# Random strict partitions and random shifted tableaux

## TL;DR

This paper investigates the asymptotic behavior of random shifted Young diagrams linked to projective representations of symmetric groups, establishing limit laws under certain convergence conditions.

## Contribution

It provides new limit theorems for the shapes of random shifted tableaux, including cases generated by combinatorial algorithms like shifted RSK.

## Key findings

- Law of Large Numbers for shifted tableaux shapes
- Central Limit Theorem for asymptotic fluctuations
- Applicability to combinatorial algorithms like shifted RSK

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