2018/02/03 by Anton Leykin, Leykin, Anton, Abraham Martín del Campo +7
Computer Science · #14N15 #65H10 #Algebraic Geometry (math.AG) #FOS: Mathematics #Numerical Analysis (math.NA) #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1802.00984
openalex publication_date 2018/02/03 · openalex created_date 2022/10/05 · openalex updated_date 2026/07/28
We develop the Littlewood-Richardson homotopy algorithm, which uses numerical\ncontinuation to compute solutions to Schubert problems on Grassmannians and is\nbased on the geometric Littlewood-Richardson rule. One key ingredient of this\nalgorithm is our new optimal formulation of Schubert problems in local Stiefel\ncoordinates as systems of equations. Our implementation can solve problem\ninstances with tens of thousands of solutions.\n