English

Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods

Symbolic Computation 2016-06-20 v1 Mathematical Software Algebraic Geometry Numerical Analysis

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.

Cite

@article{arxiv.1606.05563,
  title  = {Computing all Space Curve Solutions of Polynomial Systems by Polyhedral Methods},
  author = {Nathan Bliss and Jan Verschelde},
  journal= {arXiv preprint arXiv:1606.05563},
  year   = {2016}
}

Comments

14 pages, 1 figure, accepted for presentation at Computer Algebra in Scientific Computing, CASC 2016

R2 v1 2026-06-22T14:28:01.728Z