Universidad Complutense de Madrid
E-Prints Complutense

Separation of semialgebraic sets



Último año

Acquistapace, Francesca y Andradas Heranz, Carlos y Broglia, Fabrizio (1999) Separation of semialgebraic sets. Journal of the American Mathematical Society, 12 (3). pp. 703-728. ISSN 0894-0347

[img] PDF
Restringido a Sólo personal autorizado del repositorio hasta 2020.


URL Oficial: http://www.ams.org/jourcgi/jrnl_toolbar_nav/jams_all


We study the problem of deciding whether two disjoint semialgebraic sets of an algebraic variety over R are separable by a polynomial. For that we isolate a dense
subfamily of spaces of orderings, named geometric, which suffice to test separation and that reduce the problem to the study of the behaviour of the semialgebraic sets in their boundary. Then we derive several characterizations for the generic separation, among which there is a geometric criterion that can be tested algorithmically. Finally we show how to check recursively whether we can pass from generic separation to separation,
obtaining a decision procedure for solving the problem.

Tipo de documento:Artículo
Palabras clave:decidability of separation problem of semialgebraic sets; algorithm
Materias:Ciencias > Matemáticas > Geometria algebraica
Código ID:14799
Depositado:18 Abr 2012 08:32
Última Modificación:06 Feb 2014 10:09

Descargas en el último año

Sólo personal del repositorio: página de control del artículo