Small Littlewood-Richardson coefficients
From MaRDI portal
Publication:737966
DOI10.1007/s10801-015-0658-2zbMath1342.05188arXiv1209.1521OpenAlexW2122656101MaRDI QIDQ737966
Publication date: 12 August 2016
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.1521
Symmetric functions and generalizations (05E05) Combinatorial aspects of representation theory (05E10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Semisimple Lie groups and their representations (22E46) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (3)
The Horn inequalities from a geometric point of view ⋮ Generalized Littlewood-Richardson coefficients for branching rules of \(\mathrm{GL}(n)\) and extremal weight crystals ⋮ Quiver generalization of a conjecture of King, Tollu, and Toumazet
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Geometric complexity theory. III: On deciding nonvanishing of a Littlewood-Richardson coefficient
- Triple multiplicities for \(s\ell (r+1)\) and the spectrum of the exterior algebra of the adjoint representation
- Geometric algorithms and combinatorial optimization.
- Finding all the perfect matchings in bipartite graphs
- The saturation conjecture (after A. Knutson and T. Tao). With an appendix by William Fulton
- On the complexity of computing Kostka numbers and Littlewood-Richardson coefficients
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- On the Computation of Clebsch–Gordan Coefficients and the Dilation Effect
- The honeycomb model of $GL_n(\mathbb C)$ tensor products I: Proof of the saturation conjecture
- Deciding Positivity of Littlewood--Richardson Coefficients
This page was built for publication: Small Littlewood-Richardson coefficients
