Table of Contents
Fetching ...

Numerical Schubert calculus

Birkett Huber, Frank Sottile, Bernd Sturmfels

TL;DR

This work develops semi-numerical, path-continuation methods for solving polynomial systems arising from Schubert calculus on Grassmannians. It introduces two optimal extrinsic deformations for hypersurface Schubert conditions—the Gröbner homotopy (Plücker-ideal) and the SAGBI homotopy (projective coordinate ring)—and a Pieri-based intrinsic deformation (Pieri homotopy) for general special Schubert conditions, all yielding exactly $d$ solution planes without path divergence. The Pieri framework relies on moving cycles, Pieri trees, and Kostka numbers to reduce the problem to transversal triple intersections and sequential homotopies, with correctness grounded in Pieri's formula and Schubert calculus. The methods are demonstrated computationally on moderate-size instances, with applications to control theory (pole assignment) and real enumerative geometry, and are shown to outperform traditional Gröbner-based approaches in several cases. Overall, the paper provides a robust toolkit for numerically solving Schubert-geometry problems via optimal, structure-exploiting homotopies and illustrates practical impact through computational results.

Abstract

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface Schubert conditions we give two algorithms based on extrinsic deformations of the Grassmannian: one is derived from a Gröbner basis for the Plücker ideal of the Grassmannian and the other from a SAGBI basis for its projective coordinate ring. The more general case of special Schubert conditions is solved by delicate intrinsic deformations, called Pieri homotopies, which first arose in the study of enumerative geometry over the real numbers. Computational results are presented and applications to control theory are discussed.

Numerical Schubert calculus

TL;DR

This work develops semi-numerical, path-continuation methods for solving polynomial systems arising from Schubert calculus on Grassmannians. It introduces two optimal extrinsic deformations for hypersurface Schubert conditions—the Gröbner homotopy (Plücker-ideal) and the SAGBI homotopy (projective coordinate ring)—and a Pieri-based intrinsic deformation (Pieri homotopy) for general special Schubert conditions, all yielding exactly solution planes without path divergence. The Pieri framework relies on moving cycles, Pieri trees, and Kostka numbers to reduce the problem to transversal triple intersections and sequential homotopies, with correctness grounded in Pieri's formula and Schubert calculus. The methods are demonstrated computationally on moderate-size instances, with applications to control theory (pole assignment) and real enumerative geometry, and are shown to outperform traditional Gröbner-based approaches in several cases. Overall, the paper provides a robust toolkit for numerically solving Schubert-geometry problems via optimal, structure-exploiting homotopies and illustrates practical impact through computational results.

Abstract

We develop numerical homotopy algorithms for solving systems of polynomial equations arising from the classical Schubert calculus. These homotopies are optimal in that generically no paths diverge. For problems defined by hypersurface Schubert conditions we give two algorithms based on extrinsic deformations of the Grassmannian: one is derived from a Gröbner basis for the Plücker ideal of the Grassmannian and the other from a SAGBI basis for its projective coordinate ring. The more general case of special Schubert conditions is solved by delicate intrinsic deformations, called Pieri homotopies, which first arose in the study of enumerative geometry over the real numbers. Computational results are presented and applications to control theory are discussed.

Paper Structure

This paper contains 14 sections, 6 theorems, 74 equations, 1 figure, 1 table.

Key Result

Proposition 2.1

The initial ideal $\,in_\prec(I_{m,p}) \,$ is generated by all quadratic monomials $\,[\,\alpha \,][\,\beta\,] \,$ where $\alpha_i < \beta_i$ and $\alpha_j > \beta_j \,$ for some $i,j \in \{1,\ldots,p\}$.

Figures (1)

  • Figure 1: Young's poset for $(m,p) = (3,2)$.

Theorems & Definitions (9)

  • Proposition 2.1
  • Proposition 2.2
  • Proposition 2.3
  • Proposition 3.1: Hodge and Pedoe, 1952, Theorem III in § XIV.4
  • Definition 3.2
  • Definition 3.3
  • Proposition 3.4
  • Theorem 3.5
  • Conjecture 5.1: B. Shapiro and M. Shapiro