Bernstein's theorem in affine space

DOI10.1007/BF02770870zbMath0891.65055MaRDI QIDQ677017

Bernd Sturmfels, Birkett Huber

Publication date: 19 July 1998

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

isolated zerospolynomial systemNewton polytopeshomotopies

Mathematics Subject Classification ID

Numerical computation of solutions to systems of equations (65H10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20) Zeros of polynomials, rational functions, and other analytic functions of one complex variable (e.g., zeros of functions with bounded Dirichlet integral) (30C15) Mixed volumes and related topics in convex geometry (52A39)

Related Items (23)

Mixed multiplicities of ideals versus mixed volumes of polytopes ⋮ Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study ⋮ Unmixing the mixed volume computation ⋮ Computing isolated roots of sparse polynomial systems in affine space ⋮ Early Ending in Homotopy Path-Tracking for Real Roots ⋮ Efficiently counting affine roots of mixed trigonometric polynomial systems ⋮ Heuristic methods for computing the minimal multi-homogeneous Bézout number. ⋮ Minimizing multi-homogeneous Bézout numbers by a local search method ⋮ Foreword. What is numerical algebraic geometry? ⋮ Elimination for generic sparse polynomial systems ⋮ A systematic framework for solving geometric constraints analytically ⋮ Rational univariate reduction via toric resultants ⋮ Matrices in elimination theory ⋮ Solving degenerate sparse polynomial systems faster ⋮ Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes ⋮ Deformation techniques for sparse systems ⋮ Mixed volume techniques for embeddings of Laman graphs ⋮ Elimination theory and Newton polytopes ⋮ How to count efficiently all affine roots of a polynomial system ⋮ Toric intersection theory for affine root counting ⋮ On the multiplicity of isolated roots of sparse polynomial systems ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Enumerating a subset of the integer points inside a Minkowski sum

Cites Work

• Unnamed Item
• Puiseux expansion for space curves
• The noncommutative Markovian property
• Finding sparse systems of parameters
• A convex geometric approach to counting the roots of a polynomial system
• Counting affine roots of polynomial systems via pointed Newton polytopes
• Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
• A Polyhedral Method for Solving Sparse Polynomial Systems

This page was built for publication: Bernstein's theorem in affine space