A max-flow algorithm for positivity of Littlewood-Richardson coefficients

MaRDI QIDQ3176573zbMATH OpenFDO

Authors Peter Bürgisser, Christian Ikenmeyer

Publication date 23 July 2018

Full work available at URL http://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAK0122

zbMATH Keywords

polynomial timeLittlewood-Richardson coefficientssaturation conjectureflows in network

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Symmetric functions and generalizations (05E05)

Recommendations

• Deciding positivity of Littlewood-Richardson coefficients
• Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
• Small Littlewood-Richardson coefficients
• Vanishing of Littlewood-Richardson polynomials is in P
• scientific article; zbMATH DE number 6928881

Cited in

(7)

• Small Littlewood-Richardson coefficients
• Reduction formulae of Littlewood-Richardson coefficients
• Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals
• Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
• Necessary conditions for the positivity of Littlewood-Richardson and plethystic coefficients
• Vanishing of Littlewood-Richardson polynomials is in P
• Deciding positivity of Littlewood-Richardson coefficients

This page was built for publication: A max-flow algorithm for positivity of Littlewood-Richardson coefficients

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3176573)