scientific article

zbMath1392.05112MaRDI QIDQ3176573

Christian Ikenmeyer, Peter Bürgisser

Publication date: 23 July 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

polynomial timeLittlewood-Richardson coefficientssaturation conjectureflows in network

Mathematics Subject Classification ID

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

Related Items (3)

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 ⋮ Reduction formulae of Littlewood-Richardson coefficients

This page was built for publication: