RC-graphs and a generalized Littlewood-Richardson rule
M. Kogan
TL;DR
This paper introduces a generalized insertion algorithm for rc-graphs to establish a Littlewood-Richardson rule, enabling the multiplication of specific Schubert polynomials by Schur polynomials.
Contribution
It extends the Schensted insertion algorithm to rc-graphs, providing a new combinatorial rule for Schubert polynomial multiplication.
Findings
Derived a Littlewood-Richardson rule for Schubert and Schur polynomials
Connected rc-graphs with Schubert calculus
Enhanced combinatorial tools for algebraic geometry
Abstract
Using a generalization of the Schensted insertion algorithm to rc-graphs, we provide a Littlewood-Richardson rule for multiplying certain Schubert polynomials by Schur polynomials.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Molecular spectroscopy and chirality · Advanced Mathematical Identities