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

Mostrar todas las versiones(3)

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 p...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Perrucci, D.
Formato: Artículo publishedVersion
Lenguaje:Inglés
Publicado: 2005
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_01795376_v34_n3_p475_Perrucci
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires
id paperaa:paper_01795376_v34_n3_p475_Perrucci
record_format dspace
spelling paperaa:paper_01795376_v34_n3_p475_Perrucci2023-06-12T16:47:06Z Some bounds for the number of components of real zero sets of sparse polynomials Discrete Comput. Geom. 2005;34(3):475-495 Perrucci, D. 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. 2005 info:eu-repo/semantics/article info:ar-repo/semantics/artículo info:eu-repo/semantics/publishedVersion application/pdf eng info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01795376_v34_n3_p475_Perrucci
institution Universidad de Buenos Aires
institution_str I-28
repository_str R-134
collection Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
language Inglés
orig_language_str_mv eng
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-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.
format Artículo
Artículo
publishedVersion
author Perrucci, D.
spellingShingle Perrucci, D.
Some bounds for the number of components of real zero sets of sparse polynomials
author_facet Perrucci, D.
author_sort Perrucci, D.
title Some bounds for the number of components of real zero sets of sparse polynomials
title_short Some bounds for the number of components of real zero sets of sparse polynomials
title_full Some bounds for the number of components of real zero sets of sparse polynomials
title_fullStr Some bounds for the number of components of real zero sets of sparse polynomials
title_full_unstemmed Some bounds for the number of components of real zero sets of sparse polynomials
title_sort some bounds for the number of components of real zero sets of sparse polynomials
publishDate 2005
url http://hdl.handle.net/20.500.12110/paper_01795376_v34_n3_p475_Perrucci
work_keys_str_mv AT perruccid someboundsforthenumberofcomponentsofrealzerosetsofsparsepolynomials
_version_ 1769810115509092352

Ejemplares similares