Algèbre et géométrie

Let X be a set definable in some o-minimal structure. The Pila-Wilkie theorem (in its basic form) states that the number of rational points in the transcendental part of X grows sub-polynomially with the height of the points. The Wilkie conjecture stipulates that for sets definable in R_exp, one can sharpen this asymptotic to polylogarithmic.I will describe a complex-analytic approach to the proof of the Pila-Wilkie theorem for subanalytic sets. I will then discuss how this approach leads to a proof of the `restricted Wilkie conjecture', where we replace R_exp […]

I will discuss some problems which are analogous to, but formally not comprehended within, the Zilber-Pink conjecture, involving collections of `special subvarieties' connected with uniformization maps of suitable domains.

Au début des années 2000, Haskell, Hrushovski and Macpherson ont décrit les ensembles interprétables dans un corps valué algébriquement clos à l'aide d'équivalents en plus grande dimension des boules. Plus précisément, ils ont prouvé l'élimination des imaginaires dans le language géométrique. Pendant la même période, l'intérêt des théoriciens des modèles pour les corps valués avec opérateurs s'est grandement développé. Les questions résolues pour ces structures tournent, pour la plupart, autour de l'élimination des quantificateurs et de la modération. Mais, au vu des résultats de Haskell, Hrushovski and Macpherson, il est […]

Let k be a field and let P be a lattice polygon, i.e. the convex hull in R^2 of finitely many non-collinear points of Z^2. Let C/k be the algebraic curve defined by a sufficiently generic Laurent polynomial that is supported on P. A result due to Khovanskii states that the geometric genus of C equals the number of Z^2-valued points that are contained in the interior of P. In this talk we will give an overview of various other curve invariants that can be told by looking at the […]

I will discuss joint work with Martin Bridson and Martin Liebeck which addresses the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative results. For a collection of finite simple groups that contains infinitely many alternating groups, or contains classical groups of unbounded dimensions, we prove that there is no such algorithm. On the other hand, for a collection of simple groups of fixed Lie […]

P-minimality is a concept that was developed by Haskell and Macpherson as a p-adic equivalent for o-minimality. For o-minimality, the cell decomposition theorem is probably one of the most powerful tools, so it is quite a natural question to ask for a p-adic equivalent of this.In this talk I would like to give an overview of the development of cell decomposition in the p-adic context, with an emphasis on how questions regarding the existence of definable skolem functions have complicated things. The idea of p-adic cell decomposition was first developed […]