Quantitative curve selection lemma

DOI10.1007/S00209-021-02837-0zbMATH Open1505.14120arXiv1803.00505OpenAlexW3204325824WikidataQ124940837 ScholiaQ124940837MaRDI QIDQ2114147FDOQ2114147

Authors: Saugata Basu, Marie-Françoise Roy 

Publication date: 15 March 2022

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Abstract: We prove a quantitative version of the curve selection lemma. Denoting by $s,d,k$ a bound on the number, the degree and the number of variables of the polynomials describing a semi-algebraic set $S$ and a point $x$ in $$, we find a semi-algebraic path starting at $x$ and entering in $S$ with a description of degree $(O(d{)}^{3k+3},O(d{)}^k)$ (using a precise definition of the description of a semi-algebraic path and its degree given in the paper). As a consequence, we prove that there exists a semi-algebraic path starting at $x$ and entering in $S$, such that the degree of the Zariski closure of the image of this path is bounded by $O(d{)}^{4k+3}$, improving a result of Jelonek and Kurdyka. We also give an algorithm for describing the real isolated points of $S$ whose complexity is bounded by $s^{2k+1}{d}^{O(k)}$ improving a result of Le, Safey el Din, and de Wolff.

Full work available at URL: https://arxiv.org/abs/1803.00505

Recommendations

• scientific article; zbMATH DE number 17838
• Computing Roadmaps of General Semi-Algebraic Sets
• scientific article; zbMATH DE number 1256732
• Divide and conquer roadmap for algebraic sets
• Computing Roadmaps of Semi-algebraic Sets on a Variety (Extended Abstract)

zbMATH Keywords

algorithmsemi-algebraic setscurve selection

Mathematics Subject Classification ID

Semialgebraic sets and related spaces (14P10) Computational real algebraic geometry (14Q30)

Cites Work

• Singular Points of Complex Hypersurfaces. (AM-61)
• Algorithms in real algebraic geometry
• Solving zero-dimensional systems through the rational univariate representation
• Title not available (Why is that?)
• Thom's lemma, the coding of real algebraic numbers and the computation of the topology of semi-algebraic sets
• Computing the real isolated points of an algebraic hypersurface
• Reaching generalized critical values of a polynomial

Cited In (1)

• Improved effective Łojasiewicz inequality and applications

This page was built for publication: Quantitative curve selection lemma

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