Computing all space curve solutions of polynomial systems by polyhedral methods

DOI10.1007/978-3-319-45641-6_6MaRDI QIDQ2829992zbMATH OpenOpenAlexFDO

Authors Nathan Bliss, J. Verschelde

Publication date 9 November 2016

Published in Computer Algebra in Scientific Computing (Search for Journal in Brave)

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

zbMATH Keywords

Newton polytopepolyhedral end gamepolyhedral methodpolynomial systemPuiseux seriesspace curvetropical basistropical prevarietytropism

Mathematics Subject Classification ID

Solving polynomial systems; resultants (13P15) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Combinatorial aspects of tropical varieties (14T15) Numerical computation of solutions to systems of equations (65H10) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Symbolic computation and algebraic computation (68W30)

Abstract: A polyhedral method to solve a system of polynomial equations exploits its sparse structure via the Newton polytopes of the polynomials. We propose a hybrid symbolic-numeric method to compute a Puiseux series expansion for every space curve that is a solution of a polynomial system. The focus of this paper concerns the difficult case when the leading powers of the Puiseux series of the space curve are contained in the relative interior of a higher dimensional cone of the tropical prevariety. We show that this difficult case does not occur for polynomials with generic coefficients. To resolve this case, we propose to apply polyhedral end games to recover tropisms hidden in the tropical prevariety.

Recommendations

• Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Puiseux power series solutions for systems of equations
• Polyhedral methods in numerical algebraic geometry
• scientific article; zbMATH DE number 6790660

Cites work

• A Polyhedral Method for Solving Sparse Polynomial Systems
• Affine solution sets of sparse polynomial systems
• Algorithm 795
• Computing Gröbner fans and tropical varieties in \texttt{Gfan}
• Computing Puiseux series for algebraic surfaces
• Computing Tropical Curves via Homotopy Continuation
• Computing tropical resultants
• Computing tropical varieties
• Deformation techniques for sparse systems
• Elimination for generic sparse polynomial systems
• Generic tropical varieties
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• scientific article; zbMATH DE number 6437647 (Why is no real title available?)
• scientific article; zbMATH DE number 236540 (Why is no real title available?)
• Numerical-symbolic exact irreducible decomposition of cyclic-12
• Polyhedral end games for polynomial continuation
• Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem
• Polyhedral methods in numerical algebraic geometry
• Pruning algorithms for pretropisms of Newton polytopes
• Puiseux expansions and nonisolated points in algebraic varieties
• The number of roots of a system of equations

Cited in

(2)

• Pruning algorithms for pretropisms of Newton polytopes
• Polyhedral methods for space curves exploiting symmetry applied to the cyclic \(n\)-roots problem

Describes a project that uses

Uses Software

• PHCpack
• Macaulay2
• LBNL
• OEIS
• Gfan
• phcpy

This page was built for publication: Computing all space curve solutions of polynomial systems by polyhedral methods

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