1 citations · 1 across the 9 of their papers we have counts for
4 papers · 1 filter
Rigid homotopies for sampling from algebraic varieties: a Waring structure complexity model
Abigail R. Jones, Kisun Lee, Jose Israel Rodriguez
Polynomial system solving has seen major progress in both theory and practice over the past decade. A landmark achievement was addressing Smale's 17th problem, establishing average…
Certifying Galois/monodromy Actions via Homotopy Graphs
Timothy Duff, Kisun Lee
We develop a certified numerical algorithm for computing Galois/monodromy groups of parametrized polynomial systems. Our approach employs certified homotopy path tracking to guaran…
Certified surface approximations using the interval Krawczyk test
Michael Burr, Jonathan D. Hauenstein, Kisun Lee
We propose an algorithm to construct a certified approximation of a surface by generalizing the Krawczyk test. The Krawczyk test is based on interval arithmetic, and confirms the e…
Asymptotic rank bounds: a numerical census
Kisun Lee
We systematically compute improved asymptotic rank bounds for tensors. Using numerical implicitization, we implement the geometric framework of Kaski and Michałek across all comput…