Algèbre et géométrie

Real semialgebraic sets admit so-called cellular decomposition, i.e. representation as a union of convenient semialgebraic images of standard cubes. The Gromov-Yomdin Lemma (later generalized by Pila and Wilkie) proves that the maps could be chosen of C^r-smooth norm at most one, and the number of such maps is uniformly bounded for finite-dimensional families. This number was not effectively bounded by Yomdin or Gromov, but itnecessarily grows as r ? ?. It turns out there is a natural obstruction to a naive holomorphic complexification of this result related to the natural […]

Tame geometry is the study of structures where the definable sets admit finite complexity. Around 15 years ago Pila and Wilkie discovered a deep connection between tame geometry and diophantine approximation, in the form of asymptotic estimates on the number of rational points in a tame set (as a function of height). This later led to deep applications in diophantine geometry, functional transcendence and Hodge theory.I will describe some conjectures and a long-term project around a more effective form of tame geometry, suited for improving the quality of the diophantine […]