scientific article; zbMATH DE number 2051430
The aim of the article is to provide an elementary introduction to polyhedral methods for understanding and solving systems of multivariate polynomial equations. The author does not assume a background in algebraic geometry. His treatment culminates at a self-contained proof of an extended version of Bernstein's Theorem relating volumes of polytopes with the number of connected components of the complex zero set of a system of polynomial equations. For low dimensions the author also gives a complexity bound, namely for computing mixed area and thereby the generic number of complex roots of two polynomial equations in the plane. For the entire collection see [Zbl 1029.00024].
- Deformation techniques for sparse systems
- Elimination for generic sparse polynomial systems
- Numeric vs. symbolic homotopy algorithms in polynomial system solving: a case study
- Rational univariate reduction via toric resultants
- Polynomial Equations and Convex Polytopes
- Computing isolated roots of sparse polynomial systems in affine space
- How many zeroes? Counting solutions of systems of polynomials via toric geometry at infinity
- Tropical algebraic geometry in Maple: a preprocessing algorithm for finding common factors for multivariate polynomials with approximate coefficients
- Tropical geometries and dynamics of biochemical networks application to hybrid cell cycle models
- Zero-Hopf bifurcation of limit cycles in certain differential systems
- A short proof for the parameter continuation theorem
- Sparse systems and algorithmic equidimensional decomposition
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4453667)