Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials
Abstract
Description
We prove that the zero set of a 4-nomial in n variables in the positive orthant has at most three connected components. This bound, which does not depend on the degree of the polynomial, not only improves the best previously known bound (which was 10) but is optimal as well. In the general case, we prove that the number of connected components of the zero set of an m-nomial in n variables in the positive orthant is lower than or equal to (n+1)^{m-1}2^{1 + (m - 1)(m - 2)/2}, improving slightly the known bounds. Finally, we show that for generic exponents, the number of non-compact connected components of the zero set of a 5-nomial in three variables in the positive octant is at most 12. This strongly improves the best previously known bound, which was 10384. All the bounds obtained in this paper continue to hold for real exponents.
24 pages, 6 figures. Corrected typos, added references
24 pages, 6 figures. Corrected typos, added references