Breaking down the reduced Kronecker coefficients
We resolve three interrelated problems on reduced Kronecker coefficients $\overline{g}(\alpha ,\beta ,\gamma )$. First, we disprove the saturation property which states that $\overline{g}(N\alpha ,N\beta ,N\gamma )>0$ implies $\overline{g}(\alpha ,\beta ,\gamma )>0$ for all $N>1$. Second, w...
Main Authors: | Pak, Igor, Panova, Greta |
---|---|
Format: | Article |
Language: | English |
Published: |
Académie des sciences
2020-07-01
|
Series: | Comptes Rendus. Mathématique |
Online Access: | https://comptes-rendus.academie-sciences.fr/mathematique/articles/10.5802/crmath.60/ |
Similar Items
-
Kronecker coefficients: the tensor square conjecture and unimodality
by: Igor Pak, et al.
Published: (2014-01-01) -
Deligne categories and reduced Kronecker coefficients
by: Entova-Aizenbud, Inna
Published: (2016) -
The complexity of computing Kronecker coefficients
by: Peter Bürgisser, et al.
Published: (2008-01-01) -
Quantum Complexity of the Kronecker Coefficients
by: Sergey Bravyi, et al.
Published: (2024-02-01) -
Plane partitions and the combinatorics of some families of reduced Kronecker coefficients.
by: Laura Colmenarejo
Published: (2020-04-01)