algebra / Representation theory of symmetric groups; Kronecker coefficients

The tensor square conjecture for symmetric groups: some irreducible representation of S_n has a tensor square containing every irreducible

Theorem 1.1: for every positive integer n∉{2,4,9}n\notin\{2,4,9\} there is λ⊢n\lambda\vdash n, necessarily self-conjugate, with g(λ,λ,ν)>0g(\lambda,\lambda,\nu)>0 for every ν⊢n\nu\vdash n. Corollary 1.2 transfers this through Letellier's results to unipotent characters of GLn(Fq)GL_n(\mathbb F_q) for every prime power qq. The construction combines the cyclic Saxl theorem with band, balance and capacity arguments, and a finite verification for small degrees. Not shown: an explicit closed-form family of such λ\lambda at nontriangular degrees beyond the construction, or bounds on the coefficients.

28Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts

Temporal state

Current frontier

No reconciled state yet.

Append-only history

Frontier timeline

algebraSep 24, 2026Significance 28/100Registry: lean checked

The tensor square conjecture for symmetric groups: some irreducible representation of S_n has a tensor square containing every irreducible

Prior state unknown→proved

Theorem 1.1: for every positive integer n∉{2,4,9}n\notin\{2,4,9\} there is λ⊢n\lambda\vdash n, necessarily self-conjugate, with g(λ,λ,ν)>0g(\lambda,\lambda,\nu)>0 for every ν⊢n\nu\vdash n. Corollary 1.2 transfers this through Letellier's results to unipotent characters of GLn(Fq)GL_n(\mathbb F_q) for every prime power qq. The construction combines the cyclic Saxl theorem with band, balance and capacity arguments, and a finite verificati…

SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review

Research memory

Claims and attempts

Scoped claims

Source authenticated

Theorem 1.1: for every positive integer n∉{2,4,9}n\notin\{2,4,9\} there is λ⊢n\lambda\vdash n, necessarily self-conjugate, with g(λ,λ,ν)>0g(\lambda,\lambda,\nu)>0 for every ν⊢n\nu\vdash n. Corollary 1.2 transfers this through Letellier's results to unipotent characters of GLn(Fq)GL_n(\mathbb F_q) for every prime power qq. The construction combines the cyclic Saxl theorem with band, balance and capacity arguments, and a finite verification for small degrees. Not shown: an explicit closed-form family of such λ\lambda at nontriangular degrees beyond the construction, or bounds on the coefficients.

Theorem 1.1: for every positive integer n∉{2,4,9}n\notin\{2,4,9\} there is λ⊢n\lambda\vdash n, necessarily self-conjugate, with g(λ,λ,ν)>0g(\lambda,\lambda,\nu)>0 for every ν⊢n\nu\vdash n. Corollary 1.2 transfers this through Letellier's results to unipotent characters of GLn(Fq)GL_n(\mathbb F_q) for every prime power qq. The construction combines the cyclic Saxl theorem with band, balance and capacity arguments, and a finite verification for small degrees. Not shown: an explicit closed-form family of such λ\lambda at nontriangular degrees beyond the construction, or bounds on the coefficients.

Recorded attempts

Evidence graph

Connected research record

The tensor square conjecture for symmetric groups: some irreducible representation of S_n has a tensor square containing every irreducible — Mathematical Frontier Network