Staircase Minimality and a Proof of Saxl's Conjecture
Soong Kyum Lee

TL;DR
This paper proves Saxl's conjecture that the tensor square of the staircase representation contains all irreducible representations, using a new staircase minimality theorem and dominance order arguments.
Contribution
It introduces the Staircase Minimality Theorem and completes the proof of Saxl's conjecture unconditionally, characterizing Kronecker-universal self-conjugate partitions at triangular numbers.
Findings
Proves Saxl's conjecture unconditionally.
Establishes staircase partitions as dominance-minimal among 2-regular partitions.
Characterizes Kronecker-universal self-conjugate partitions at triangular numbers.
Abstract
Saxl's conjecture (2012) asserts that for the staircase partition , the tensor square of the corresponding irreducible representation of the symmetric group contains every irreducible representation as a constituent, where is the th triangular number. We prove this conjecture unconditionally. Our proof introduces the Staircase Minimality Theorem: among all 2-regular partitions of , the staircase is the unique dominance-minimal element. Combined with Ikenmeyer's theorem on dominance and Kronecker positivity for staircases, this establishes that every 2-regular partition appears in the tensor square. Modular saturation then follows using only the diagonal entries of the decomposition matrix, and the Bessenrodt--Bowman--Sutton lifting theorem completes the proof. We further prove that at…
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.
