Solving Schubert problems with Littlewood-Richardson homotopies

From MaRDI portal
Publication:2946537

DOI10.1145/1837934.1837971zbMATH Open1321.68541arXiv1001.4125OpenAlexW2143746847MaRDI QIDQ2946537FDOQ2946537


Authors: R. Vakil, J. Verschelde, Frank Sottile Edit this on Wikidata


Publication date: 17 September 2015

Published in: Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Abstract: We present a new numerical homotopy continuation algorithm for finding all solutions to Schubert problems on Grassmannians. This Littlewood-Richardson homotopy is based on Vakil's geometric proof of the Littlewood-Richardson rule. Its start solutions are given by linear equations and they are tracked through a sequence of homotopies encoded by certain checker configurations to find the solutions to a given Schubert problem. For generic Schubert problems the number of paths tracked is optimal. The Littlewood-Richardson homotopy algorithm is implemented using the path trackers of the software package PHCpack.


Full work available at URL: https://arxiv.org/abs/1001.4125




Recommendations




Cites Work


Cited In (4)

Uses Software





This page was built for publication: Solving Schubert problems with Littlewood-Richardson homotopies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946537)