Zero-patterns of polynomials and Newton polytopes.

DOI10.1016/S0097-3165(03)00007-4MaRDI QIDQ1873810zbMATH OpenOpenAlexFDO

Authors Alan G. B. Lauder

Publication date 27 May 2003

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0097-3165(03)00007-4, http://www.sciencedirect.com/science/article/pii/S0097316503000074

zbMATH Keywords

hypersurfacemultivariate polynomialNewton polytopesign-patternzero-pattern

Mathematics Subject Classification ID

Polynomials in number theory (11C08) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20)

Recommendations

• On the number of zero-patterns of a sequence of polynomials
• Some bounds for the number of components of real zero sets of sparse polynomials
• Random polynomials with prescribed Newton polytope
• scientific article; zbMATH DE number 203206
• Polynomial Equations and Convex Polytopes

Cites work

• Absolute irreducibility of polynomials via Newton polytopes
• Dual Polyhedra and Mirror Symmetry for Calabi-Yau Hypersurfaces in Toric Varieties
• scientific article; zbMATH DE number 446694 (Why is no real title available?)
• scientific article; zbMATH DE number 5532114 (Why is no real title available?)
• scientific article; zbMATH DE number 863501 (Why is no real title available?)
• Irreducibility of polynomials modulo p via Newton polytopes.
• Newton polyhedra and the degree of the L-function associated to an exponential sum
• On the number of zero-patterns of a sequence of polynomials
• Polynomial Equations and Convex Polytopes

Cited in

(1)

• The set of m-th equal partition points of n-simplex and decision of the zero polynomial

This page was built for publication: Zero-patterns of polynomials and Newton polytopes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1873810)