|
This article is cited in 37 scientific papers (total in 37 papers)
New fewnomial upper bounds from Gale dual polynomial system
F. Bihana, F. Sottileb a Universite de Savoie
b Texas A&M University
Abstract:
We show that there are fewer than $\frac{e^2+3}{4}2^{\binom{k}{2}}n^k$ positive solutions to a fewnomial system consisting of $n$ polynomials in $n$ variables having a total of $n+k+1$ distinct monomials. This is significantly smaller than Khovanskii's fewnomial bound of $2^{\binom{n+k}{2}}(n+1)^{n+k}$. We reduce the original system to a system of $k$ equations in $k$ variables 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 $\mathbb R^n$ defined by a polynomial with $n+k+1$ monomials has at most $C(k)n^{k-1}$ compact connected components. Our results hold for polynomials with real exponents.
Key words and phrases:
Gale dual, sparse polynomial.
Received: September 15, 2006
Citation:
F. Bihan, F. Sottile, “New fewnomial upper bounds from Gale dual polynomial system”, Mosc. Math. J., 7:3 (2007), 387–407
Linking options:
https://www.mathnet.ru/eng/mmj287 https://www.mathnet.ru/eng/mmj/v7/i3/p387
|
|