Fewnomial bounds for completely mixed polynomial systems

DOI10.1515/ADVGEOM.2011.019zbMath1232.14041arXiv0905.4543MaRDI QIDQ3087020

Frank J. Sottile, Frédéric Bihan

Publication date: 2 August 2011

Published in: advg (Search for Journal in Brave)

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

zbMATH Keywords

upper boundfewnomialsparse polynomial systemreal polynomial system

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Enumerative problems (combinatorial problems) in algebraic geometry (14N10) Real algebraic and real-analytic geometry (14P99)

Related Items (4)

Coamoebas of Polynomials Supported on Circuits ⋮ A polyhedral homotopy algorithm for real zeros ⋮ Continuity of the asymptotics of expected zeros of fewnomials ⋮ On the intersection of a sparse curve and a low-degree curve: a polynomial version of the lost theorem

Cites Work

• The number of roots of a lacunary bivariate polynomial on a line

This page was built for publication: Fewnomial bounds for completely mixed polynomial systems