Deciding Positivity of Littlewood--Richardson Coefficients

DOI10.1137/120892532zbMath1285.05172arXiv1204.2484OpenAlexW2063231447MaRDI QIDQ5408584

Christian Ikenmeyer, Peter Bürgisser

Publication date: 10 April 2014

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

polynomial-time algorithmLittlewood-Richardson coefficientsflows in networkshive model

Mathematics Subject Classification ID

Symmetric functions and generalizations (05E05) Combinatorial optimization (90C27) Semisimple Lie groups and their representations (22E46)

Related Items (13)

Semiclassical asymptotics of \(\mathrm {GL}_N(\mathbb C)\) tensor products and quantum random matrices ⋮ Rectangular Kronecker coefficients and plethysms in geometric complexity theory ⋮ Effective Poset Inequalities ⋮ Sparse multivariate polynomial interpolation on the basis of Schubert polynomials ⋮ Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients ⋮ On the largest Kronecker and Littlewood-Richardson coefficients ⋮ Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals ⋮ A combinatorial proof of the skew K-saturation theorem ⋮ On the complexity of computing Kronecker coefficients ⋮ Small Littlewood-Richardson coefficients ⋮ $$P\mathop{ =}\limits^{?}NP$$ ⋮ Unifying known lower bounds via geometric complexity theory ⋮ Membership in Moment Polytopes is in NP and coNP

This page was built for publication: Deciding Positivity of Littlewood--Richardson Coefficients