Betti Numbers of Deterministic and Random Sets in Semi-Algebraic and O-Minimal Geometry

Abhiram Natarajan, Purdue University

Abstract

Studying properties of random polynomials has marked a shift in algebraic geometry. Instead of worst-case analysis, which often leads to overly pessimistic perspectives, randomness helps perform average-case analysis, and thus obtain a more realistic view. Also, via Erd˝os’ astonishing ’probabilistic method’, one can potentially obtain deterministic results by introducing randomness into a question that apriori had nothing to do with randomness.In this thesis, we study topological questions in real algebraic geometry, o-minimal geometry and random algebraic geometry, with motivation from incidence combinatorics. Specifically, we prove results along two different threads:(a) Topology of semi-algebraic and definable (over any o-minimal structure over R) sets, in both deterministic and random settings.(b) Topology of random hypersurface arrangements. In this case, we also prove a result that could be of independent interest in random graph theory.Towards the first thread, motivated by applications in o-minimal incidence combinatorics, we prove bounds (both deterministic and random) on the topological complexity (as measured by the Betti numbers) of general definable hypersurfaces restricted to algebraic sets (Basu et al., 2019b). Given any sequence of hypersurfaces, we show that there exists a definable hypersurface Γ, and a sequence of polynomials, such that each manifold in the sequence of hypersurfaces appears as a component of Γ restricted to the zero set of some polynomial in the sequence of polynomials. This shows that the topology of the intersection of a definable hypersurface and an algebraic set can be made arbitrarily pathological. On the other hand, we show that for random polynomials, the Betti numbers of the restriction of the zero set of a random polynomial to any definable set deviates from a B´ezout-type bound with bounded probability.Progress in o-minimal incidence combinatorics has lagged behind the developments in incidence combinatorics in the algebraic case due to the absence of an o-minimal version of the Guth-Katz polynomial partitioning theorem, and the first part of our work explains why this is so difficult. However, our average result shows that if we can prove that the measure of the set of polynomials which satisfy a certain property necessary for polynomial partitioning is suitably bounded from below, by the probabilistic method, we get an o-minimal polynomial partitioning theorem. This would be a tremendous breakthrough and would enable progress on multiple fronts in model theoretic combinatorics.Along the second thread, we have studied the average Betti numbers of random hypersurface arrangements (Basu et al., 2019a). Specifically, we study how the average Betti numbers of a finite arrangement of random hypersurfaces grows in terms of the degrees of the polynomials in the arrangement, as well as the number of polynomials. This is proved using a random Mayer-Vietoris spectral sequence argument. We supplement this result with a better bound on the average Betti numbers when one considers an arrangement of quadrics. This question turns out to be equivalent to studying the expected number of connected components of a certain random graph model, which has not been studied before, and thus could be of independent interest. While our motivation once again was incidence combinatorics, we obtained the first bounds on the topology of arrangements of random hypersurfaces, with an unexpected bonus of a result in random graphs.

Degree

Ph.D.

Advisors

Grigorescu, Purdue University.

Subject Area

Language|Mathematics|Artificial intelligence

COinS