The complexity of computing Kronecker coefficients
Kronecker coefficients are the multiplicities in the tensor product decomposition of two irreducible representations of the symmetric group $S_n$. They can also be interpreted as the coefficients of the expansion of the internal product of two Schur polynomials in the basis of Schur polynomials. We...
Main Authors: | Peter Bürgisser, Christian Ikenmeyer |
---|---|
Format: | Article |
Language: | English |
Published: |
Discrete Mathematics & Theoretical Computer Science
2008-01-01
|
Series: | Discrete Mathematics & Theoretical Computer Science |
Subjects: | |
Online Access: | https://dmtcs.episciences.org/3622/pdf |
Similar Items
-
Kronecker coefficients: the tensor square conjecture and unimodality
by: Igor Pak, et al.
Published: (2014-01-01) -
Quasipolynomial formulas for the Kronecker coefficients indexed by two two―row shapes (extended abstract)
by: Emmanuel Briand, et al.
Published: (2009-01-01) -
(k − 2)-linear connected components in hypergraphs of rank k
by: Florian Galliot, et al.
Published: (2023-11-01) -
On Kerov polynomials for Jack characters (extended abstract)
by: Valentin Féray, et al.
Published: (2013-01-01) -
Noncommutative Symmetric Hall-Littlewood Polynomials
by: Lenny Tevlin
Published: (2011-01-01)