Théorie des Modèles et Groupes

Perin et Sklinos, et indépendamment Ould Houcine, ont démontré en 2011 que les groupes libres sont homogènes : deux éléments qui ont le même type sont dans la même orbite sous l'action du groupe d'automorphismes. Dans cet exposé, j'expliquerai que ce résultat reste presque vrai pour les groupes virtuellement libres, au sens suivant : l'ensemble des éléments ayant le même type qu'un élément donné contient un nombre fini d'orbites sous le groupe d'automorphismes, et ce nombre ne dépend pas de l'élément considéré. J'expliquerai également pourquoi je pense que ce résultat […]

(En collaboration avec Joshua Wiscons)L'exposé mélange théorie des modèles, théorie des groupes, et algèbre géométrique. On y parlera de groupes de rang de Morley fini, mais il suffit de savoir naïvement ce qu'est une dimension à valeurs entières, sans devoir maîtriser les finesses de la conjecture de Cherlin-Zilber.Un groupe abstrait porte peu d'information de nature géométrique, même au sens des géométries d'incidence, et c'est toujours remarquable si cela se produit.Le pur groupe SO(3,R), par exemple, permet de redéfinir l'espace projectif réel. PGL(2,C) permet presque la même chose : il définit […]

Let G be a group. A subgroup H of G is a Cartan subgroup ofG if H is a maximal nilpotent subgroup of G, and for every normal finiteindex subgroup X of H, X has finite index in its normalizer in G.We consider Cartan subgroups of definably connect groups definable inan o-minimal structure. In we proved that, in this context,Cartan subgroups of G exist, they are definable and they fall infinitely many conjugacy classes.In this talk I will prove that the union of the Cartan subgroups isdense in the group, […]

Using ultraproducts, I will describe the spectrum of the profinite completion of the integers and of the finite adeles over the rationals.The final aim is to describe the structure sheaf of these structures.Joint work with Margarita Otero and Angus Macintyre.

Nous présenterons une preuve de la Propriété (T) de Kazhdan pour les groupes d'automorphismes de structures métriques aleph_0-catégoriques. Ceci généralise des résultats précédents de Bekka (pour le groupe unitaire) et de Evans et Tsankov (pour les groupes pro-oligomorphes), sans besoin de faire appel à des résultats de classification de représentations unitaires. En effet, l'argument est purement modèle-théorique et basé sur des principes de la stabilité locale.

There is a well-known analogy between the arithmetic of rational numbers and the theory of meromorphic functions over a normed field. It is a classical result of Julia Robinson that the first order theory of the field of rational numbers is undecidable, and one would expect such a result in the meromorphic setting. In this talk I'll give an outline of the proof of undecidability for rigid meromorphic functions in positive characteristic

A continuous theory T of bounded metric structures is said to be kappa-categorical if T has a unique model of density kappa. Work of Ben Yaacov and Shelah+Usvyatsov shows that Morley's Theorem holds in this context: if T has a countable signature and is kappa-categorical for some uncountable kappa, then T is kappa-categorical for all uncountable kappa. In classical (discrete) model theory, there are several characterizations of uncountable categoricity. For example, there is a structure theorem for uncountably categorical theories T, due to Baldwin+Lachlan: there is a strongly minimal set […]

The following conjecture is due to Shelah--Hasson: Any infinite strongly NIP field is either real closed, algebraically closed, or admits a non-trivial definable henselian valuation, in the language of rings. We specialise this conjecture to ordered fields in the language of ordered rings, which leads towards a systematic study of the class of strongly NIP almost real closed fields. As a result, we obtain a complete characterisation of this class.

Joint with Itay Kaplan and Pierre Simon.Distal theories are NIP theories which are ?Roewholly unstable?R. Chernikov and Simon's ?Roestrong honest definitions?R characterise distal theories as those in which every type is compressible. Adapting recent work in machine learning of Chen, Cheng, and Tang on bounds on the ?Roerecursive teaching dimension?R of a finite concept class, we find that compressibility is dense in NIP structures, i.e. any formula can be completed to a compressible type in S(A). Considering compressibility as an isolation notion (which specialises to l-isolation in stable theories), we […]

The word and conjugacy problems are central decision problems associated with finitely generated groups. In particular, there are deep results which bridge some of the main concepts of the theories of computability and computational complexity with group theoretical invariants through the word problem in groups. In this talk I will recall some of the well-known facts about the word and conjugacy problems in groups as well as discuss new results concerning the relationship between them.

Orderable groups are extensively studied by logicians and group theorists. In my talk I will address aspects of left- or bi-orderable groups that are connected with computability theory. In particular, I will talk about constructions of bi-orderable computable groups that cannot be embedded into groups with computable bi-order. I will also discuss our recent work in progress with M. Steenbock about simplicity and computably left-orderability.

I will give a complete description of all groups definable in Presburger arithmetic, up to finite index subgroups. This builds on previous work on bounded groups in Presburger arithmetic by Mariana Vicaria and Alf Onshuus.