Combinatrial complexity in o-minimal structures

Saugata Basu
Purdue University

In this talk I will explain how various notions of complexities in the semi-algebraic case generalize to more general families of sets -- in particular, to o-minimal structures over an arbitrary real closed fields. I will show how this generalization leads to simpler proofs in certain cases. If time permits I will explain a Ramsey-theoretic application as an example.

Back to Combinatorial and Computational Geometry: Tutorials