On the complexity of computing Kronecker coefficients
From MaRDI portal
Publication:2012174
DOI10.1007/s00037-015-0109-4zbMath1367.05012arXiv1404.0653OpenAlexW2962883077MaRDI QIDQ2012174
Publication date: 28 July 2017
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1404.0653
Analysis of algorithms and problem complexity (68Q25) Combinatorial aspects of partitions of integers (05A17) Symmetric functions and generalizations (05E05) Representations of finite symmetric groups (20C30)
Related Items
Cluster algebras, invariant theory, and Kronecker coefficients. II., Interview with Igor Pak, Critical classes, Kronecker products of spin characters, and the Saxl conjecture, Algorithmically distinguishing irreducible characters of the symmetric group, Bounds on Kronecker coefficients via contingency tables, Quantum mechanics of bipartite ribbon graphs: integrality, lattices and Kronecker coefficients, Effective Poset Inequalities, Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients, Interview with Victor Reiner, Tensor product Markov chains, Combinatoric topological string theories and group theory algorithms, On the complexity of computing Kronecker coefficients, Saxl conjecture for triple hooks, Invariant operators, orthogonal bases and correlators in general tensor models, Unnamed Item, Vanishing of Littlewood-Richardson polynomials is in P, Breaking down the reduced Kronecker coefficients, Vector partition functions and Kronecker coefficients
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Unimodality via Kronecker products
- Kronecker coefficients for one hook shape
- Combinatorics and geometry of Littlewood-Richardson cones
- An invitation to the generalized saturation conjecture
- On rectangular Kronecker coefficients.
- Reduced Kronecker coefficients and counter-examples to Mulmuley's strong saturation conjecture SH
- The stability of the Kronecker product of Schur functions
- Nonzero Kronecker coefficients and what they tell us about spectra
- Kronecker products, characters, partitions, and the tensor square conjectures
- Integer points in polyhedra
- On the Kronecker product of \(S_n\) characters
- Tensorprodukte von Charakteren der symmetrischen Gruppe
- Stability of Kronecker products of irreducible characters of the symmetric group
- Stable properties of plethysm: On two conjectures of Foulkes
- The Kronecker product of Schur functions indexed by two-row shapes or hook shapes
- A formula for the Kronecker products of Schur functions of hook shapes
- Tableau switching: Algorithms and applications
- On the complexity of computing Kronecker coefficients
- Kronecker multiplicities in the \((k,\ell)\) hook are polynomially bounded.
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- Effective lattice point counting in rational convex polytopes
- A combinatorial interpretation for the coefficients in the Kronecker product \(s_{(n-p,p)} \ast s_\lambda\)
- Reductions of Young Tableau Bijections
- Products and Plethysms of Characters with Orthogonal, Symplectic and Symmetric Groups
- The Kronecker Product of Symmetric Group Representations
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
- Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension
- The Complexity of Three-Way Statistical Tables
- Applications of approximation algorithms to cooperative games
- The partition algebra and the Kronecker coefficients
- Deciding Positivity of Littlewood--Richardson Coefficients
- The Analysis of the Direct Product of Irreducible Representations of the Symmetric Groups
- Algorithms - ESA 2003