Ikenmeyer's Kronecker Positivity

• Ikenmeyer's Kronecker Positivity is a criterion establishing positive Kronecker coefficients in tensor squares of staircase partitions within symmetric groups.
• The approach leverages dominance order, geometric invariant theory, and combinatorial constructions to guarantee nonzero representation multiplicities.
• This framework underpins the resolution of Saxl’s conjecture and informs computational complexity, highlighting NP-hardness and asymptotic positivity issues.

Ikenmeyer’s Kronecker Positivity refers to a powerful criterion for the positivity of Kronecker coefficients in the context of symmetric group representations, specifically involving tensor squares of staircase partitions. This result gives a broad infinite family of positive instances for Kronecker coefficients, connecting deep combinatorial, geometric, and representation-theoretic aspects, and plays a central role in the resolution of Saxl’s conjecture. The criterion underpins advances in computational complexity and geometric complexity theory, and also illuminates the structure of tensor invariants and their combinatorics.

1. Kronecker Coefficient Positivity: Definitions and Dominance Order

Let $S_n$ denote the symmetric group on $n$ letters, and let $S^{\lambda}$ denote its irreducible representation indexed by the partition $\lambda \vdash n$. The Kronecker coefficient $g(\lambda, \mu, \nu)$ is the multiplicity with which the irreducible $S^\lambda$ appears in the decomposition of the tensor product $S^\mu \otimes S^\nu$: $$S^\mu \otimes S^\nu \cong \bigoplus_{\lambda \vdash n} g(\lambda, \mu, \nu) S^{\lambda}$$ A coefficient is said to be positive if $g(\lambda, \mu, \nu) > 0$.

The dominance order on partitions $\lambda, \mu \vdash n$ is defined by

$n$0

This partial order plays a central role in classifying constituents in symmetric group tensor products.

2. Statement and Consequences of Ikenmeyer’s Theorem

Consider the staircase partition $n$1 of $n$2. Ikenmeyer’s theorem states:

Theorem (Ikenmeyer, 2015): If $n$3 satisfies $n$4 or $n$5, then $n$6.

In other words, for any partition $n$7 of $n$8 that is dominance-comparable to the staircase, the corresponding irreducible appears in the tensor square $n$9, guaranteeing positivity of $S^{\lambda}$0 for a substantial class of $S^{\lambda}$1 (Lee, 17 Dec 2025).

This positivity applies in both directions of dominance and is fundamentally nontrivial, given the lack of a general combinatorial formula for Kronecker coefficients and the inherent computational hardness of positivity (NP-hardness) in the general case (Bürgisser, 2015).

3. Proof Structure and Geometric Interpretation

Ikenmeyer’s proof employs a geometric representation-theoretic framework:

• Kronecker coefficients are interpreted as dimensions of spaces of global sections on products of flag varieties, where positivity translates to the nonemptiness of a space associated to weights $S^{\lambda}$2.
• The moment polytope describing these spaces is defined by the dominance inequalities; the region of dominance-comparable partitions characterizes where these polytopes are nonempty.
• A combinatorial semigroup argument is used to construct explicit highest-weight vectors corresponding to such $S^{\lambda}$3, certifying positivity by explicit construction.

This approach leverages geometric invariant theory, highest-weight theory, and the combinatorics of Young tableaux to reduce positivity to an elegant dominance criterion (Lee, 17 Dec 2025).

4. Examples and Characterization for Small $S^{\lambda}$4

Explicit enumeration for small staircase partitions illustrates the scope and limitations:

• For $S^{\lambda}$5, $S^{\lambda}$6, and $S^{\lambda}$7, all partitions except $S^{\lambda}$8 and $S^{\lambda}$9 are dominance-comparable to $\lambda \vdash n$0 and thus yield $\lambda \vdash n$1.
• For $\lambda \vdash n$2, with 42 partitions of 10, only four are incomparable to $\lambda \vdash n$3; for the remaining 38, positivity holds.

This demonstrates that the dominance comparability criterion covers almost all partitions for small $\lambda \vdash n$4, but there exist explicit exceptions not covered by the theorem (Lee, 17 Dec 2025).

5. Integration into the Proof of Saxl’s Conjecture

Ikenmeyer’s Kronecker positivity is the positivity engine powering the full proof of Saxl’s conjecture:

1. Staircase Minimality Theorem: Among all 2-regular partitions (those with no repeated parts) of $\lambda \vdash n$5, the staircase is the unique dominance-minimal element: every 2-regular $\lambda \vdash n$6 satisfies $\lambda \vdash n$7 with equality only for $\lambda \vdash n$8.
2. 2-Regular Positivity: Ikenmeyer’s theorem then implies every such $\lambda \vdash n$9-regular partition appears in $g(\lambda, \mu, \nu)$0.
3. Modular Saturation: In characteristic 2, the decomposition matrix diagonal entries $g(\lambda, \mu, \nu)$1 for $g(\lambda, \mu, \nu)$2-regular $g(\lambda, \mu, \nu)$3, so the projective cover multiplicities in the modular setting are at least $g(\lambda, \mu, \nu)$4.
4. Lifting Theorem: A result of Bessenrodt–Bowman–Sutton shows that positive projective cover multiplicities lift to positivity in characteristic 0, so every $g(\lambda, \mu, \nu)$5 satisfies $g(\lambda, \mu, \nu)$6.

This establishes Saxl’s conjecture in full generality (Lee, 17 Dec 2025).

6. Kronecker Positivity: Complexity and Broader Context

While Ikenmeyer’s criterion delivers a positive combinatorial family, the general decision problem for positivity of Kronecker coefficients is computationally intractable:

• NP-Hardness: The decision problem $g(\lambda, \mu, \nu)$7 is NP-hard, as shown by Ikenmeyer, Mulmuley, and Walter, unlike the Littlewood–Richardson coefficient positivity which lies in P.
• Asymptotic Positivity: The problem “does $g(\lambda, \mu, \nu)$8 for some $g(\lambda, \mu, \nu)$9?” reduces to polyhedral membership in a rational cone, placing the problem in NP $S^\lambda$0 coNP (Bürgisser, 2015).
• Barvinok-Type Algorithms: For bounded-length partitions (fixed $S^\lambda$1), positivity can be decided in $S^\lambda$2 time using semigroup and integer feasibility algorithms (Pak et al., 2014). For unrestricted $S^\lambda$3, the problem remains hard.

Problem Type	Complexity	Key Reference
$S^\lambda$4	NP-hard	(Bürgisser, 2015)
Asymptotic positivity	NP$S^\lambda$5coNP	(Bürgisser, 2015)
Positivity, fixed parts	$S^\lambda$6	(Pak et al., 2014)

This suggests that dominance-based criteria substantially expand the tractable landscape of Kronecker positivity, but the general problem remains beyond efficient computation.

7. Extensions, Generalizations, and Open Problems

Ikenmeyer’s geometric methods and dominance-positive families extend in two principal directions:

• Rectangular Kronecker Coefficients: Investigations into GCT obstructions examine the positivity of coefficients $S^\lambda$7; Ikenmeyer showed the corresponding monoid is saturated, with all “gaps” corresponding to genuine obstructions (Bürgisser, 2015).
• Latin Hypercubes and Generalized Positivity: Connections to the (generalized) Alon–Tarsi conjecture imply that nonvanishing signed counts of Latin cubes would resolve the positivity of entire families of generalized Kronecker coefficients at rectangular shapes (Amanov et al., 2022). In particular, for $S^\lambda$8, the positivity of $S^\lambda$9 for $S^\mu \otimes S^\nu$0 is conditional on the Alon–Tarsi conjecture for Latin cubes.

Outstanding questions concern the full combinatorial characterization of Kronecker positivity, the structure and saturation properties of associated monoids, and algorithmic refinements for restricted families with additional symmetries (Amanov et al., 2022).

---

References:

• "Staircase Minimality and a Proof of Saxl's Conjecture" (Lee, 17 Dec 2025)
• "Permanent versus determinant, obstructions, and Kronecker coefficients" (Bürgisser, 2015)
• "On the complexity of computing Kronecker coefficients" (Pak et al., 2014)
• "Fundamental invariants of tensors, Latin hypercubes, and rectangular Kronecker coefficients" (Amanov et al., 2022)