Abstract. We show that the problem of deciding positivity of Kronecker coefficients is NP-hard. Previously, this problem was conjectured to be in P, just as for the Littlewood-Richardson coefficients. Our result establishes in a formal way that Kronecker coefficients are more difficult than Littlewood-Richardson coefficients, unless P = NP. We also show that there exists a #P -formula for a particular subclass of Kronecker coefficients whose positivity is NP-hard to decide. This is an evidence that, despite the hardness of the positivity problem, there may well exist a positive combinatorial formula for the Kronecker coefficients. Finding such a formula is a major open problem in representation theory and algebraic combinatorics. Finally, we consider the existence of the partition triples (λ, μ, π) such that the Kronecker coefficient k λ μ,π = 0 but the Kronecker coefficient k lλ lμ,lπ > 0 for some integer l > 1. Such "holes" are of great interest as they witness the failure of the saturation property for the Kronecker coefficients, which is still poorly understood. Using insight from computational complexity theory, we turn our hardness proof into a positive result: We show that not only do there exist many such triples, but they can also be found efficiently. Specifically, we show that, for any 0 < ≤ 1, there exists 0 < a < 1 such that, for all m, there exist Ω(2 m a ) partition triples (λ, μ, μ) in the Kronecker cone such that: (a) the Kronecker coefficient k λ μ,μ is zero, (b) the height of μ is m, (c) the height of λ is ≤ m , and (d) |λ| = |μ| ≤ m 3 . The proof of the last result illustrates the effectiveness of the explicit proof strategy of GCT.
In REF it was shown that deciding positivity of Kronecker coefficients in general is NP-hard, but this proof fails for rectangular formats.
On vanishing of Kronecker coefficients
computational complexity
computational complexity
Mathematics Computer Science