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

DOI10.1007/s10801-011-0325-1zbMath1271.03055arXivcs/0501076MaRDI 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

algorithms; Littlewood-Richardson coefficients; geometric complexity theory

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

17B10: Representations of Lie algebras and Lie superalgebras, algebraic theory (weights)

14L24: Geometric invariant theory

03D15: Complexity of computation (including implicit computational complexity)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)