On sign conditions over real multivariate polynomials
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilist...
Guardado en:
Autores principales: | , , |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_01795376_v44_n1_p195_Jeronimo |
Aporte de: |
id |
todo:paper_01795376_v44_n1_p195_Jeronimo |
---|---|
record_format |
dspace |
spelling |
todo:paper_01795376_v44_n1_p195_Jeronimo2023-10-03T15:08:32Z On sign conditions over real multivariate polynomials Jeronimo, G. Perrucci, D. Sabia, J. Complexity Consistency problem Real multivariate polynomials Sign conditions We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions over the polynomials. In addition, we extend these results to the case of closed sign conditions over an arbitrary family of real multivariate polynomials. The complexity bounds for these procedures improve the known ones. © Springer Science+Business Media, LLC 2009. Fil:Jeronimo, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Perrucci, D. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Sabia, J. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar http://hdl.handle.net/20.500.12110/paper_01795376_v44_n1_p195_Jeronimo |
institution |
Universidad de Buenos Aires |
institution_str |
I-28 |
repository_str |
R-134 |
collection |
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) |
topic |
Complexity Consistency problem Real multivariate polynomials Sign conditions |
spellingShingle |
Complexity Consistency problem Real multivariate polynomials Sign conditions Jeronimo, G. Perrucci, D. Sabia, J. On sign conditions over real multivariate polynomials |
topic_facet |
Complexity Consistency problem Real multivariate polynomials Sign conditions |
description |
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a family of real polynomials defining regular hypersurfaces that intersect transversally. This enables us to show a probabilistic procedure to list all feasible sign conditions over the polynomials. In addition, we extend these results to the case of closed sign conditions over an arbitrary family of real multivariate polynomials. The complexity bounds for these procedures improve the known ones. © Springer Science+Business Media, LLC 2009. |
format |
JOUR |
author |
Jeronimo, G. Perrucci, D. Sabia, J. |
author_facet |
Jeronimo, G. Perrucci, D. Sabia, J. |
author_sort |
Jeronimo, G. |
title |
On sign conditions over real multivariate polynomials |
title_short |
On sign conditions over real multivariate polynomials |
title_full |
On sign conditions over real multivariate polynomials |
title_fullStr |
On sign conditions over real multivariate polynomials |
title_full_unstemmed |
On sign conditions over real multivariate polynomials |
title_sort |
on sign conditions over real multivariate polynomials |
url |
http://hdl.handle.net/20.500.12110/paper_01795376_v44_n1_p195_Jeronimo |
work_keys_str_mv |
AT jeronimog onsignconditionsoverrealmultivariatepolynomials AT perruccid onsignconditionsoverrealmultivariatepolynomials AT sabiaj onsignconditionsoverrealmultivariatepolynomials |
_version_ |
1807319021358415872 |