Bernstein's theorem in affine space
DOI10.1007/BF02770870zbMATH Open0891.65055MaRDI QIDQ677017FDOQ677017
Birkett Huber, Bernd Sturmfels
Publication date: 19 July 1998
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Recommendations
Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Numerical computation of solutions to systems of equations (65H10) 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) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)
Cites Work
- Title not available (Why is that?)
- The noncommutative Markovian property
- Homotopies Exploiting Newton Polytopes for Solving Sparse Polynomial Systems
- A Polyhedral Method for Solving Sparse Polynomial Systems
- Puiseux expansion for space curves
- A convex geometric approach to counting the roots of a polynomial system
- Counting affine roots of polynomial systems via pointed Newton polytopes
- Finding sparse systems of parameters
Cited In (29)
- Matrices in elimination theory
- Bernstein type theorems for higher codimension
- A systematic framework for solving geometric constraints analytically
- A Bernstein property for F relative parabolic affine hyperspheres
- Numerical homotopies to compute generic points on positive dimensional algebraic sets
- Computing isolated roots of sparse polynomial systems in affine space
- Mixed volume techniques for embeddings of Laman graphs
- On the multiplicity of isolated roots of sparse polynomial systems
- Heuristic methods for computing the minimal multi-homogeneous Bézout number.
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Deformation techniques for sparse systems
- How to count efficiently all affine roots of a polynomial system
- Enumerating a subset of the integer points inside a Minkowski sum
- Unmixing the mixed volume computation
- Toric intersection theory for affine root counting
- Finding all isolated zeros of polynomial systems in \(\mathbb{C}^n\) via stable mixed volumes
- Rational univariate reduction via toric resultants
- Mixed multiplicities of ideals versus mixed volumes of polytopes
- Minimizing multi-homogeneous Bézout numbers by a local search method
- On the affine Bernstein problem
- Solving degenerate sparse polynomial systems faster
- Elimination for generic sparse polynomial systems
- Elimination theory and Newton polytopes
- General Bezout-type theorems
- Efficiently counting affine roots of mixed trigonometric polynomial systems
- Foreword. What is numerical algebraic geometry?
- Burmester theory in Cayley-Klein planes with affine base
- The affine Bernstein and boundary value problems
- Early Ending in Homotopy Path-Tracking for Real Roots
This page was built for publication: Bernstein's theorem in affine space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q677017)
