A Cyclic Polytabloid Proof of Saxl's Conjecture
For every integer and every partition , the Kronecker coefficient , where ; equivalently, contains every irreducible complex representation of .
The deduction from Theorem 3.1 is immediate and rigorous, and Theorem 3.1 itself is fully proved.
“Theorem 1.1 (Saxl’s conjecture). For every integer m ≥ 1 and every partition λ ⊢ Nm, g(ρm, ρm, λ) > 0. Equivalently, Sρm ⊗ Sρm contains every irreducible complex representation of SNm.” · Show in paper