2000 character limit reached
Numerical homotopies from Khovanskii bases
Published 29 Aug 2020 in math.AG | (2008.13055v1)
Abstract: We present numerical homotopy continuation algorithms for solving systems of equations on a variety in the presence of a finite Khovanskii basis. These take advantage of Anderson's flat degeneration to a toric variety. When Anderson's degeneration embeds into projective space, our algorithm is a special case of a general toric two-step homotopy algorithm. When Anderson's degeneration is embedded in a weighted projective space, we explain how to lift to a projective space and construct an appropriate modification of the toric homotopy. Our algorithms are illustrated on several examples using Macaulay2.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.