All Kronecker coefficients are reduced Kronecker coefficients

Abstract

We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a reduced Kronecker coefficient by an explicit construction. This implies the equivalence of a question by Stanley from 2000 and a question by Kirillov from 2004 about combinatorial interpretations of these two families of coefficients. Moreover, as a corollary, we deduce that deciding the positivity of reduced Kronecker coefficients is $NP$-hard, and computing them is $\#P$-hard under parsimonious many-one reductions.

arXiv comment15 pages

References in corpus (12)

• The Structure of Bipartite Quantum States - Insights from Group Theory and Cryptography
• Quantum marginal problem and representations of the symmetric group
• The stability of the Kronecker products of Schur functions
• On vanishing of Kronecker coefficients
• Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
• Proof of Stembridge's conjecture on stability of Kronecker coefficients
• Computing Multiplicities of Lie Group Representations
• Symmetric group characters as symmetric functions
• Membership in moment polytopes is in NP and coNP
• Recoupling coefficients and quantum entropies
• What is a combinatorial interpretation?
• Complexity and asymptotics of structure constants