Universal Tensor Squares for Symmetric Groups
For every positive integer there is a partition such that for every , resolving the tensor square conjecture for symmetric groups affirmatively.
The proof completely covers all positive integers by combining the small-degree exact character verification () with the constructive self-conjugate family for , supported by the cyclic staircase theorem and exhaustive capacity checks.
“Theorem 1.1. For every positive integer n /∈ {2, 4, 9} there is a partition λ ⊢ n such that g(λ, λ, ν) > 0 for every ν ⊢ n. Thus one irreducible representation has a tensor square containing every irreducible representation of Sn.” · Show in paper