Reality and Computation in Schubert Calculus
Nickolas Hein

TL;DR
This paper advances real osculating Schubert calculus by computationally analyzing over 300 million instances, uncovering new conjectures, proving some, and improving solution methods for Schubert problems.
Contribution
It generalizes the Mukhin-Tarasov-Varchenko Theorem, develops efficient computational techniques, and establishes new invariants and bounds in real Schubert calculus.
Findings
Number of real solutions is congruent modulo four to the total solutions.
Discovered lower bounds for real solutions depending on real osculation points.
Proved several conjectures relating to real solutions in Schubert problems.
Abstract
The Mukhin-Tarasov-Varchenko Theorem (previously the Shapiro Conjecture) asserts that a Schubert problem has all solutions distinct and real if the Schubert varieties involved osculate a rational normal curve at real points. This sparked interest in real osculating Schubert calculus, and computations played a large role in developing the surrounding theory. We uncover generalizations of the Mukhin-Tarasov-Varchenko Theorem, proving them when possible. We also improve the state of the art of computationally solving Schubert problems, allowing us to more effectively study ill-understood phenomena in Schubert calculus. We use supercomputers to methodically solve real osculating instances of Schubert problems. By studying over 300 million instances of over 700 Schubert problems, we amass data significant enough to reveal possible generalizations of the Mukhin-Tarasov-Varchenko Theorem and…
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 · Polynomial and algebraic computation · Topological and Geometric Data Analysis
