Bounding the number of stable homotopy types of a parametrized family of semi-algebraic sets defined by quadratic inequalities
Saugata Basu, Michael Kettner

TL;DR
This paper establishes a nearly optimal exponential bound in the number of parameters and inequalities on the stable homotopy types of semi-algebraic sets defined by quadratic inequalities, with the bound polynomial in the ambient dimension.
Contribution
It provides a new bound on the number of stable homotopy types for parametrized semi-algebraic sets defined by quadratic inequalities, improving understanding of their topological complexity.
Findings
Bound is exponential in parameters and inequalities, polynomial in ambient dimension.
Number of stable homotopy types is at most (2^m * l * k * d)^{O(mk)}.
Result applies to semi-algebraic sets defined by quadratic inequalities in real closed fields.
Abstract
We prove a nearly optimal bound on the number of stable homotopy types occurring in a k-parameter semi-algebraic family of sets in , each defined in terms of m quadratic inequalities. Our bound is exponential in k and m, but polynomial in . More precisely, we prove the following. Let be a real closed field and let \[ {\mathcal P} = \{P_1,...,P_m\} \subset \R[Y_1,...,Y_\ell,X_1,...,X_k], \] with . Let be a semi-algebraic set, defined by a Boolean formula without negations, whose atoms are of the form, . Let be the projection on the last k co-ordinates. Then, the number of stable homotopy types amongst the fibers is bounded by \[ (2^m\ell k d)^{O(mk)}. \]
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.
