Separation of semialgebraic sets

From MaRDI portal
Publication:4243740

DOI10.1090/S0894-0347-99-00302-1zbMATH Open0917.14032arXivalg-geom/9611023MaRDI QIDQ4243740FDOQ4243740


Authors: Francesca Acquistapace, Fabrizio Broglia, Carlos Andradas Edit this on Wikidata


Publication date: 19 May 1999

Published in: Journal of the American Mathematical Society (Search for Journal in Brave)

Abstract: In this paper 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 the generic separation to the separation of the two sets, yielding a decision procedure to solve the problem.


Full work available at URL: https://arxiv.org/abs/alg-geom/9611023




Recommendations




Cites Work


Cited In (14)





This page was built for publication: Separation of semialgebraic sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4243740)