NEW FEWNOMIAL UPPER BOUNDS FROM GALE DUAL POLYNOMIAL SYSTEMS

By Frédéric Bihan, Frank Sottile. 2006

91 citations recorded by the source corpus.

We show that there are fewer than e 2 +3 4 2 ( k 2) n k positive solutions to a fewno- mial system consisting of n polynomials in n variables having a total of n+k+1 dis- tinct monomials. This is significantly smaller than Khovanskii's fewnomial bound of 2 ( n+k 2 ) (n+1) n+k . We reduce the original system to a system of k equations in k vari- ables which depends upon the vector configuration Gale dual to the exponents of the monomials in the original system. We then bound the number of solutions to this Gale system. We adapt these methods to show that a hypersurface in the positive orthant of R n defined by a polynomial with n+k+1 monomials has at most C(k)n ki1 compact connected components. Our results hold for polynomials with real exponents.

Subfields: Computational Theory and Mathematics, Geometry and Topology

View Paper: https://www.semanticscholar.org/paper/378cb30e88b5e6f0bd4dce234d6dd053fdd6935c