On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface

Details On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface

2007-01-24

arxiv.org/abs/math/0701667v3

Mathematics

Algebraic Geometry

5 pages, proof of main theorem corrected

Scientific paper

We show the existence of systems of n polynomial equations in n variables, with a total of n+k+1 distinct monomial terms, possessing [n/k+1]^k nondegenerate positive solutions. (Here, [x] is the integer part of a positive number x.) This shows that the recent upper bound of (e^2+3)/4 2^{\binom{k}{2}} n^k for the number of nondegenerate positive solutions is asymptotically sharp for fixed k and large n. We also adapt a method of Perrucci to show that there are fewer than (e^2+3)/4 2^{\binom{k}{2}} 2^n n^k connected components in a smooth hypersurface in the positive orthant of R^n defined by a polynomial with n+k+1 monomials. Our results hold for polynomials with real exponents.

Affiliated with

Also associated with

No associations

Rating

On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface 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 On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Sharpness of fewnomial bound and the number of components of a fewnomial hypersurface will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-603421