Beyond Polyhedral Homotopies
classification
🧮 math.AG
cs.SC
keywords
homotopiespolyhedralpolynomialalgorithmicapproachbeyondcontinuationelements
read the original abstract
We present a new algorithmic framework which utilizes tropical geometry and homotopy continuation for solving systems of polynomial equations where some of the polynomials are generic elements in linear subspaces of the polynomial ring. This approach generalizes the polyhedral homotopies by Huber and Sturmfels.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.