Abstract
A classic result in real algebraic geometry due to Oleinik-Petrovskii, Thom and Milnor, bounds the topological complexity (the sum of the Betti numbers) of basic semi-algebraic sets. This bound is tight as one can construct examples having that many connected components. However, till now no significantly better bounds were known on the individual higher Betti numbers. We prove better bounds on the individual Betti numbers of basic semi-algebraic sets, as well as arrangements of algebraic hypersurfaces. As a corollary we obtain a polynomial bound on the highest Betti numbers of basic semi-algebraic sets defined by quadratic inequalities.
Cite
CITATION STYLE
Basu, S. (2003). Different bounds on the different Betti numbers of semi-algebraic sets. In Discrete and Computational Geometry (Vol. 30, pp. 65–85). Springer New York. https://doi.org/10.1007/s00454-003-2922-9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.