Breaking down the reduced Kronecker coefficients
From MaRDI portal
Publication:784225
DOI10.5802/crmath.60zbMath1444.05147arXiv2003.11398OpenAlexW3045722145MaRDI QIDQ784225
Publication date: 3 August 2020
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.11398
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Representations of finite symmetric groups (20C30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Plethysms of chromatic and Tutte symmetric functions ⋮ Bounds on Kronecker coefficients via contingency tables ⋮ Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients ⋮ Vector partition functions and Kronecker coefficients
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- An invitation to the generalized saturation conjecture
- The stability of the Kronecker product of Schur functions
- Nonzero Kronecker coefficients and what they tell us about spectra
- Combinatorics on a family of reduced Kronecker coefficients
- On the asymptotics of Kronecker coefficients.
- On the Kronecker product of \(S_n\) characters
- Stability of Kronecker products of irreducible characters of the symmetric group
- On vanishing of Kronecker coefficients
- On the complexity of computing Kronecker coefficients
- Bounds on Kronecker coefficients via contingency tables
- On the Durfee size of Kronecker products of characters of the symmetric group and its double covers.
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- On the largest Kronecker and Littlewood-Richardson coefficients
- Products of symmetric group characters
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Products and Plethysms of Characters with Orthogonal, Symplectic and Symmetric Groups
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- The partition algebra and the Kronecker coefficients
- Proof of Stembridge's conjecture on stability of Kronecker coefficients
This page was built for publication: Breaking down the reduced Kronecker coefficients