A family of reductions for Schubert intersection problems
H. Bercovici, W. S. Li, and D. Timotin

TL;DR
This paper introduces a family of reduction techniques for Schubert intersection problems that preserve key coefficients and facilitate explicit solutions when the coefficient equals one.
Contribution
It presents a novel set of reductions for Schubert intersection problems that maintain Littlewood-Richardson coefficients and enable explicit solutions in specific cases.
Findings
Reductions do not change Littlewood-Richardson coefficients.
Explicit solutions are obtained when the coefficient is 1.
Reductions are verified via linear dimension calculations.
Abstract
We produce a family of reductions for Schubert intersection problems whose applicability is checked by calculating a linear combination of the dimensions involved. These reductions do not alter the Littlewood-Richardson coefficient, and they lead to an explicit solution of the intersection problem when this coefficient is 1.
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 · Mathematics and Applications · Polynomial and algebraic computation
