Source authenticated

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.

Exact FrontierDelta

Prior state unknown→proved

Scope and record

Occurred: Sep 24, 2026

Delta type: SOURCE CLAIM

Assumptions: VibeMathed verification: lean-checked. Publication: announcement. AI contribution: ai-discovered. VibeMathed editorial classifications, scores, notes, relations, and dataset structure are CC BY 4.0. Source statements and linked content retain their own rights.

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

Confidence: Not scored

Registry verification: lean checked · announcement · candidate

Open the source record ↗

Attribution

VibeMathed
registry · event recorded by

Unreleased internal OpenAI model
model · ai model contributor · OpenAI

Artifacts and verifiers

Lean proof: OAI/RepresentationTheory/UniversalSquare/Main.lean

lean artifact · pending

Artifact ↗
Lean statement: ComparatorChallenges/UniversalTensorSquares.lean

lean artifact · pending

Artifact ↗

Compute record

No linked compute attempts recorded.

Lineage and corrections

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

This event attributed to Unreleased internal OpenAI model

Companion manuscript: A Cyclic Polytabloid Proof of Saxl's Conjecture evidence for this event

Lean statement: ComparatorChallenges/UniversalTensorSquares.lean evidence for this event

Pak, Panova and Vallejo, Kronecker products, characters, partitions, and the tensor square conjectures evidence for this event

VibeMathed record: The tensor square conjecture for symmetric groups: some irreducible representation of S_n has a tensor square containing every irreducible evidence for this event

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. parent of this event

Lean proof: OAI/RepresentationTheory/UniversalSquare/Main.lean evidence for this event

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

Act on this frontier

Verify, challenge, or extend the result.

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