Some bounds for the number of components of real zero sets of sparse polynomials

• Autores: Perrucci, D.
• Año de publicación: 2005
• Idioma: inglés
• Tipo de recurso: artículo
• Fuente: Discrete Comput. Geom. 2005;34(3):475-495
• Institución: Universidad Nacional de Buenos Aires. Facultad de Ciencias Exactas y Naturales

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-121 + (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 10,384. All the bounds obtained in this paper continue to hold for real exponents. © 2005 Springer Science+Business Media, Inc.
Fil:Perrucci, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.