Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation

Deciding efficiently the emptiness of a real algebraic set defined by a single equation is a fundamental problem of computational real algebraic geometry. We propose an algorithm for this test. We find, when the algebraic set is non empty, at least one point on each semi-algebraically connected component. The problem is reduced to deciding the existence of real critical points of the distance function and computing them.

[1]  Fabrice Rouillier,et al.  Solving Zero-Dimensional Systems Through the Rational Univariate Representation , 1999, Applicable Algebra in Engineering, Communication and Computing.

[2]  John F. Canny,et al.  Some algebraic and geometric computations in PSPACE , 1988, STOC '88.

[3]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[4]  David A. Cox,et al.  Ideals, Varieties, and Algorithms , 1997 .

[5]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[6]  Marie-Françoise Roy,et al.  Zeros, multiplicities, and idempotents for zero-dimensional systems , 1996 .

[7]  D. Mumford.  Algebraic Geometry I: Complex Projective Varieties , 1981 .

[8]  Fabrice Rouillier,et al.  Symbolic Recipes for Real Solutions , 1999 .

[9]  V. Weispfenning.  Solving Parametric Polynomial Equations And Inequalities By Symbolic Algorithms , 1995 .

[10]  Volker Weispfenning,et al.  Quantifier Elimination for Real Algebra — the Quadratic Case and Beyond , 1997, Applicable Algebra in Engineering, Communication and Computing.

[11]  Marie-Françoise Roy,et al.  Generic computation of the real closure of an ordered field , 1996 .

[12]  A. Seidenberg.  A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[13]  S. Basu,et al.  A New Algorithm to Find a Point in Every Cell Defined by a Family of Polynomials , 1998 .

[14]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[15]  Renaud Rioboo,et al.  Real algebraic closure of an ordered field: implementation in Axiom , 1992, ISSAC '92.

[16]  Jochem Fleischer,et al.  Computer Algebra in Science and Engineering , 1995 .

[17]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[18]  Scott McCallum,et al.  An Improved Projection Operation for Cylindrical Algebraic Decomposition , 1985, European Conference on Computer Algebra.

[19]  Marie-Françoise Roy,et al.  Real algebraic geometry , 1992 .

[20]  Christopher W. Brown.  Improved Projection for Cylindrical Algebraic Decomposition , 2001, J. Symb. Comput..

[21]  Dima Grigoriev,et al.  Solving Systems of Polynomial Inequalities in Subexponential Time , 1988, J. Symb. Comput..

[22]  James Renegar.  On the computational complexity and geome-try of the first-order theory of the reals , 1992 .

[23]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[24]  V. Weispfenning.  A New Approach to Quantifier Elimination for Real Algebra , 1998 .

[25]  Joos Heintz,et al.  On the Theoretical and Practical Complexity of the Existential Theory of Reals , 1993, Comput. J..

[26]  Fabrice Rouillier,et al.  Algorithmes efficaces pour l'etude des zeros reels des systemes polynomiaux , 1996 .

[27]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[28]  Marie-Françoise Roy,et al.  On the combinatorial and algebraic complexity of Quanti erEliminationS , 1994 .

[29]  Joos Heintz,et al.  On the Complexity of Semialgebraic Sets , 1989, IFIP Congress.

[30]  J. Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I , 1989 .

[31]  R. J. Walker.  Algebraic curves , 1950 .