All Kronecker coefficients are reduced Kronecker coefficients
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866912125096558592 |
|---|---|
| author | Ikenmeyer, Christian Panova, Greta |
| author_facet | Ikenmeyer, Christian Panova, Greta |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_03003 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | All Kronecker coefficients are reduced Kronecker coefficients Ikenmeyer, Christian Panova, Greta Combinatorics Computational Complexity Representation Theory 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. |
| title | All Kronecker coefficients are reduced Kronecker coefficients |
| topic | Combinatorics Computational Complexity Representation Theory |
| url | https://arxiv.org/abs/2305.03003 |