Computing the real isolated points of an algebraic hypersurface

Let R be the field of real numbers. We consider the problem of computing the real isolated points of a real algebraic set in Rn given as the vanishing set of a polynomial system. This problem plays an important role for studying rigidity properties of mechanism in material designs. In this paper, we design an algorithm which solves this problem. It is based on the computations of critical points as well as roadmaps for answering connectivity queries in real algebraic sets. This leads to a probabilistic algorithm of complexity (nd)O (n log(n)) for computing the real isolated points of real algebraic hypersurfaces of degree d. It allows us to solve in practice instances which are out of reach of the state-of-the-art.

[1]  J. Schwartz,et al.  On the “piano movers” problem. II. General techniques for computing topological properties of real algebraic manifolds , 1983 .

[2]  Nicolai Vorobjov,et al.  Complexity of Computing the Local Dimension of a Semialgebraic Set , 1999, J. Symb. Comput..

[3]  Éric Schost,et al.  Properness Defects of Projections and Computation of at Least One Point in Each Connected Component of a Real Algebraic Set , 2004, Discret. Comput. Geom..

[4]  Palaiseau Cedex,et al.  Computing Parametric Geometric Resolutions , 2001 .

[5]  Éric Schost,et al.  A Baby Steps/Giant Steps Probabilistic Algorithm for Computing Roadmaps in Smooth Bounded Real Hypersurface , 2011, Discret. Comput. Geom..

[6]  Dennis S. Arnon.  A Cluster-Based Cylindrical Algebraic Decomposition Algorithm , 1988, J. Symb. Comput..

[7]  Joseph N. Grima,et al.  Auxetic behavior from rotating triangles , 2006 .

[8]  Zbigniew Jelonek,et al.  Quantitative Generalized Bertini-Sard Theorem for Smooth Affine Varieties , 2005, Discret. Comput. Geom..

[9]  Patrizia M. Gianni,et al.  Algebraic Solution of Systems of Polynomial Equations Using Groebner Bases , 1987, AAECC.

[10]  D. Duval.  Rational Puiseux expansions , 1989 .

[11]  Masahiro Shiota,et al.  Thorn’s first isotopy lemma: a semialgebraic version, with uniform bound , 1995 .

[12]  Marie-Françoise Roy,et al.  Divide and Conquer Roadmap for Algebraic Sets , 2014, Discret. Comput. Geom..

[13]  George E. Collins,et al.  Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition: a synopsis , 1976, SIGS.

[14]  Éric Schost,et al.  Polar varieties and computation of one point in each connected component of a smooth real algebraic set , 2003, ISSAC '03.

[15]  Ileana Streinu,et al.  Geometric auxetics , 2015, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.

[16]  Masahiro Shiota,et al.  Thom's first isotopy lemma: a semialgebraic version, with uniform bounds(Real Singularities and Real Algebraic Geometry) , 1992 .

[17]  Éric Schost,et al.  A Baby Step–Giant Step Roadmap Algorithm for General Algebraic Sets , 2012, Found. Comput. Math..

[18]  Joseph N. Grima,et al.  Novel honeycombs with auxetic behaviour , 2005 .

[19]  Marc Giusti,et al.  A Gröbner Free Alternative for Polynomial System Solving , 2001, J. Complex..

[20]  Mohab Safey El Din,et al.  Probabilistic Algorithm for Polynomial Optimization over a Real Algebraic Set , 2013, SIAM J. Optim..

[21]  J. E. Morais,et al.  When Polynomial Equation Systems Can Be "Solved" Fast? , 1995, AAECC.

[22]  Zhong‐Ming Li,et al.  Review on auxetic materials , 2004 .

[23]  R. Lakes.  Foam Structures with a Negative Poisson's Ratio , 1987, Science.

[24]  Ciprian S. Borcea,et al.  Periodic Auxetics: Structure and Design , 2017, The quarterly journal of mechanics and applied mathematics.

[25]  P. Zimmermann,et al.  Efficient isolation of polynomial's real roots , 2004 .

[26]  Éric Schost,et al.  A Nearly Optimal Algorithm for Deciding Connectivity Queries in Smooth and Bounded Real Algebraic Sets , 2013, J. ACM.

[27]  Robert Connelly,et al.  The Stability of Tensegrity Frameworks , 1992 .

[28]  Pierre Fraigniaud,et al.  An Optimal Ancestry Labeling Scheme with Applications to XML Trees and Universal Posets , 2016, J. ACM.

[29]  Fabrice Rouillier,et al.  Finding at Least One Point in Each Connected Component of a Real Algebraic Set Defined by a Single Equation , 2000, J. Complex..

[30]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraische Grössen. , 2022 .

[31]  L. Kronecker.  Grundzüge einer arithmetischen Theorie der algebraischen Grössen. (Abdruck einer Festschrift zu Herrn E. E. Kummers Doctor-Jubiläum, 10. September 1881.). , 2022 .

[32]  S. Basu,et al.  Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics) , 2006 .