All Kronecker coefficients are reduced Kronecker coefficients
Combinatorics
2024-11-20 v1 Computational Complexity
Representation Theory
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 -hard, and computing them is -hard under parsimonious many-one reductions.
Keywords
Cite
@article{arxiv.2305.03003,
title = {All Kronecker coefficients are reduced Kronecker coefficients},
author = {Christian Ikenmeyer and Greta Panova},
journal= {arXiv preprint arXiv:2305.03003},
year = {2024}
}
Comments
15 pages