Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm

@article{Leykin2021NumericalSC,
  title={Numerical Schubert calculus via the Littlewood-Richardson homotopy algorithm},
  author={A. Leykin and Abraham Mart{\'i}n del Campo and F. Sottile and R. Vakil and J. Verschelde},
  journal={Math. Comput.},
  year={2021},
  volume={90},
  pages={1407-1433}
}
We develop the Littlewood-Richardson homotopy algorithm, which uses numerical continuation to compute solutions to Schubert problems on Grassmannians and is based on the geometric Littlewood-Richardson rule. One key ingredient of this algorithm is our new optimal formulation of Schubert problems in local Stiefel coordinates as systems of equations. Our implementation can solve problem instances with tens of thousands of solutions. 
Classification of Schubert Galois groups in Gr(4,9)
Solving determinantal systems using homotopy techniques

References

SHOWING 1-10 OF 59 REFERENCES
Solving schubert problems with Littlewood-Richardson homotopies
Galois groups of Schubert problems via homotopy computation
Numerical Schubert Calculus
A Primal-Dual Formulation for Certifiable Computations in Schubert Calculus
A lifted square formulation for certifiable Schubert calculus
Numerical Schubert Calculus by the Pieri Homotopy Algorithm
Schubert calculus
A geometric Littlewood-Richardson rule
...
1
2
3
4
5
...