On sign conditions over real multivariate polynomials

Simple item page
dc.creatorJeronimo, Gabriela
dc.creatorPerrucci, Daniel
dc.creatorSabia, Juan
dc.date2008-01-03
dc.date2008-12-18
dc.date.accessioned2026-07-07T12:17:23Z
dc.date.available2026-07-07T12:17:23Z
dc.descriptionWe 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.
dc.descriptionextended version
dc.identifierhttps://arxiv.org/abs/0801.0586
dc.identifierhttp://arxiv.org/abs/0801.0586
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/212061
dc.subjectAlgebraic Geometry
dc.subjectComputational Geometry
dc.subjectSymbolic Computation
dc.subject14P10; 14Q20; 68W30
dc.titleOn sign conditions over real multivariate polynomials
dc.typetext

Files

Collections

arXiv