Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient

DOI10.1007/s10801-011-0325-1zbMath1271.03055arXivcs/0501076OpenAlexW2042552555MaRDI QIDQ438742

J. Herrera, H. S. Yoon

Publication date: 31 July 2012

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/cs/0501076

zbMATH Keywords

algorithmsLittlewood-Richardson coefficientsgeometric complexity theory

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Representations of Lie algebras and Lie superalgebras, algebraic theory (weights) (17B10) Geometric invariant theory (14L24) Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items

The Horn inequalities from a geometric point of view, Submodules of Kronecker modules via extension monoid products, Rectangular Kronecker coefficients and plethysms in geometric complexity theory, \(P\) versus \(NP\) and geometry, Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science, Sparse multivariate polynomial interpolation on the basis of Schubert polynomials, On vanishing of Kronecker coefficients, Kronecker products, characters, partitions, and the tensor square conjectures, Combinatorics of Newell-Littlewood numbers, Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient, Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals, The co-Pieri rule for stable Kronecker coefficients, On the complexity of computing Kronecker coefficients, On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients, Small Littlewood-Richardson coefficients, Geometric complexity theory V: Efficient algorithms for Noether normalization, $$P\mathop{ =}\limits^{?}NP$$, Vanishing of Littlewood-Richardson polynomials is in P, Breaking down the reduced Kronecker coefficients, Newell-Littlewood numbers, Generalized permutahedra and Schubert calculus, Geometric complexity theory: an introduction for geometers, Membership in Moment Polytopes is in NP and coNP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
• The complexity of computing the permanent
• A new polynomial-time algorithm for linear programming
• A path model for geodesics in Euclidean buildings and its applications to representation theory
• Geometric algorithms and combinatorial optimization.
• Tensor product multiplicities, canonical and totally positive varieties
• On vector partition functions
• Geometric Complexity Theory I: An Approach to thePvs.NPand Related Problems
• On P vs. NP and geometric complexity theory
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
• Eigencone, saturation and Horn problems for symplectic and odd orthogonal groups
• Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture