Toric intersection theory for affine root counting

DOI10.1016/S0022-4049(98)00023-1zbMath0943.14027arXivmath/9606215OpenAlexW2116399297MaRDI QIDQ1295703

V. Pereyra

Publication date: 3 September 2000

Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)

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

zbMATH Keywords

mixed volumescounting solutions of polynomial equations

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Numerical computation of solutions to systems of equations (65H10) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Mixed volumes and related topics in convex geometry (52A39)

Related Items

Unmixing the mixed volume computation, Tropical resultants for curves and stable intersection, Rational univariate reduction via toric resultants, Matrices in elimination theory, Solving degenerate sparse polynomial systems faster, Cayley-Dixon projection operator for multi-univariate composed polynomials, How to count efficiently all affine roots of a polynomial system, Toric intersection theory for affine root counting, Numerical homotopies to compute generic points on positive dimensional algebraic sets, Sparse resultant of composed polynomials. I: Mixed-unmixed case.

Cites Work

• Bernstein's theorem in affine space
• Toroidal embeddings. I
• Newton polyhedra and toroidal varieties
• Chow polytopes and general resultants
• Bézout number calculations for multi-homogeneous polynomial systems
• The number of roots of a system of equations
• Polyhedral end games for polynomial continuation
• Toric intersection theory for affine root counting
• Multigraded resultants of Sylvester type
• On the Newton polytope of the resultant
• Product formulas for resultants and Chow forms
• A convex geometric approach to counting the roots of a polynomial system
• Solving degenerate sparse polynomial systems faster
• Efficient incremental algorithms for the sparse resultant and the mixed volume
• Mixed-volume computation by dynamic lifting applied to polynomial system solving
• Counting affine roots of polynomial systems via pointed Newton polytopes
• Discriminants of polynomials in several variables
• Worst-Case Complexity Bounds on Algorithms for Computing the Canonical Structure of Finite Abelian Groups and the Hermite and Smith Normal Forms of an Integer Matrix
• NEWTON POLYHEDRA AND AN ALGORITHM FOR COMPUTING HODGE–DELIGNE NUMBERS
• THE GEOMETRY OF TORIC VARIETIES
• Asymptotically Fast Triangularization of Matrices over Rings
• On The Complexity of Computing Mixed Volumes
• The BKK root count in $\mathbf {C}^n$
• A Product-Decomposition Bound for Bezout Numbers
• A Polyhedral Method for Solving Sparse Polynomial Systems
• Convex Bodies The Brunn-MinkowskiTheory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item