Effective Bounds on Topological Types of Real Algebraic and Semialgebraic Sets
Kartoue Mady Demdah, Ibrahim Nonkane

TL;DR
This paper establishes effective, uniform bounds on the number of topological types of real algebraic and semialgebraic sets defined by bounded-degree polynomials, using a model-theoretic approach that emphasizes simplicity and generality.
Contribution
It proves the existence of effective bounds on topological types and semialgebraic homeomorphisms, extending previous results with a focus on simplicity and uniformity.
Findings
Effective bounds on topological types of real algebraic sets.
Existence of bounds on complexity of semialgebraic homeomorphisms.
Extension of results to semialgebraic sets of bounded complexity.
Abstract
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's theorem and leveraging a model-theoretic framework, we prove the existence of effective bounds on the number of distinct topological types for real algebraic sets defined by polynomials of bounded degree. While less precise than previously known doubly exponential bounds derived from methods such as Stratified Cylindrical Algebraic Decomposition, our results are obtained with minimal additional work, emphasizing simplicity and uniformity. Additionally, we establish the existence of an effective bound on the complexity of the semialgebraic homeomorphisms that describe representatives of the topological equivalence classes, offering a novel…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation
