Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials

Details Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials

2003-11-12

arxiv.org/abs/math/0311191v2

Mathematics

Algebraic Geometry

24 pages, 6 figures. Corrected typos, added references

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Some Bounds for the Number of Components of Real Zero Sets of Sparse Polynomials will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-337488