Past Logic Seminar

Let F(x,y) be a polynomial over the complex numbers. The Elekes-Ronyai theorem says that if F(x,y) is not essentially addition or multiplication, then F(x,y) exhibits expansion: for any finite subset A, B of complex numbers of size n, the size of F(A,B)={F(a,b):a in A, b in B} will be much larger than n. In fact, it is proved that |F(A,B)|>Cn^{4/3} for some constant C. In this talk, I will present a recent joint work with Martin Bays, which is an asymmetric and higher dimensional version of the Elekes-Rónyai theorem, where A and B can be taken to be of different sizes and y a tuple. This result is achieved via a generalisation of the Elekes-Szabó theorem.

A major open problem in the model theory of valued fields is to gain an understanding of the first-order theory of the power series field F((t)), where F denotes a finite field. For sufficiently "nice" henselian valued fields, the Ax-Kochen/Ershov philosophy allows to reduce questions of elementary equivalence and elementary embeddings to the analogous questions about the value group and residue field (or related structures). In my talk, I will present a new such principle which applies in particular to a large class of algebraic extensions of F((t)), albeit not to F((t)) itself. The talk is based on joint work with Konstantinos Kartas and Jonas van der Schaaf.

The open core of a structure is the reduct generated by the open definable sets. Tame topological structures (e.g. o-minimal) are often inter-definable with their open core. Structures such as M = (ℝ,<, +, ℚ) are wild in the sense that they define a dense co-dense set. Still, M is NIP and its open core is o-minimal. In this talk, we push forward the thesis that the open core of an NTP2 (a generalization of NIP) topological structure is tame. Our main result is that, under suitable conditions, the open core has quantifier elimination (every definable set is constructible), and its definable functions are generically continuous.

I will discuss several interesting examples of classes of structures for which there is a sensible first-order theory of "almost all" structures in the class, for certain notions of "almost all". These examples include the classical theory of almost all finite graphs due to Glebskij-Kogan-Liogon'kij-Talanov and Fagin (and many more examples from finite model theory), as well as more recent examples from the model theory of infinite fields: the theory of almost all algebraic extensions and the universal/existential theory of almost all completions of a global field (both joint work with Arno Fehm). Interestingly, such asymptotic theories are sometimes quite well-behaved even when the base theories are not.

Model-theoretic dividing lines have long been a source of tameness for various areas of mathematics, with combinatorics jumping on the bandwagon over the last decade or so. Szemerédi’s regularity lemma saw improvements in the realm of NIP, which were further refined in the subrealms of stability and distality. We show how relations satisfying the distal regularity lemma enjoy improved bounds for Zarankiewicz’s problem. We then pivot to arithmetic regularity lemmas as pioneered by Green, for which NIP and stability also imply improvements. Unsettled by the absence of distality in this picture, we discuss the role of distality in additive combinatorics, appealing to our result connecting distality with arithmetic tameness.

It is well known that the theory of differential-difference fields in characteristic zero has a model companion. Here by a differential-difference field I mean a field with a differential and a difference structure where the operators commute (in other words the difference structure is a differential-endomorphism). The theory DCFA_0 was studied in a series of papers by Bustamante. In this talk I will address the case of positive characteristic.

The monadic second-order theory S1S of (ℕ,<) is decidable (it essentially describes ω-automata). Undecidability of the monadic theory of (ℝ,<) was proven by Shelah. Previously, Rabin proved decidability if the monadic quantifier is restricted to Fσ-sets.
We discuss decidability for Borel sets, or even σ-combinations of analytic sets. Moreover, the Boolean combinations of Fσ-sets form an elementary substructure. Under determinacy hypotheses, the proof extends to larger classes of sets.

Ramification theory serves the dual purpose of a diagnostic tool and treatment by helping us locate, measure, and treat the anomalous behavior of mathematical objects. In the classical setup, the degree of a finite Galois extension of "nice" fields splits up neatly into the product of two well-understood numbers (ramification index and inertia degree) that encode how the base field changes. In the general case, however, a third factor called the defect (or ramification deficiency) can pop up. The defect is a mysterious phenomenon and the main obstruction to several long-standing open problems, such as obtaining resolution of singularities. The primary reason is, roughly speaking, that the classical strategy of "objects become nicer after finitely many adjustments" fails when the defect is non-trivial. I will discuss my previous and ongoing work in ramification theory that allows us to understand and treat the defect.

Von Neumann algebras which are not matrix algebras, yet still possess a unique trace, form a basic class called II$_1$ factors. The set of asymptotically commuting elements (or, the relative commutant of the algebra within its own ultrapower), dubbed the central sequence algebra, can take many different forms. In this talk, we discuss an elementary class of II$_1$ factors whose central sequence algebra is again a II$_1$ factor. We show that the class of infinitely generic II$_1$ factors possess this property, and ask some related questions about properties of other existentially closed II$_1$ factors. This is based on joint work with Isaac Goldbring, David Jekel, and Srivatsav Kunnawalkam Elayavalli.

Given a locally compact topological group, there is a correspondence between idempotent probability measures and compact subgroups. An analogue of this correspondence continues into the model theoretic setting. In particular, if G is a stable group, then there is a one-to-one correspondence between idempotent Keisler measures and type-definable subgroups. The proof of this theorem relies heavily on the theory of local ranks in stability theory. Recently, we have been able to extend a version of this correspondence to the abelian setting. Here, we prove that fim idempotent Keisler measures correspond to fim subgroups. These results rely on recent work of Conant, Hanson and myself connecting generically stable measures to generically stable types over the randomization. This is joint work with Artem Chernikov and Krzysztof Krupinski.

In the first half of the talk, I will briefly survey the theory of matroids with coefficients, which was introduced by Andreas Dress and Walter Wenzel in the 1980s and refined by the speaker and Nathan Bowler in 2016. This theory provides a unification of vector subspaces, matroids, valuated matroids, and oriented matroids. Then, in the second half, I will outline an intriguing connection between Lorentzian polynomials, as defined by Petter Brändén and June Huh, and matroids with coefficients.  The second part of the talk represents joint work with June Huh, Mario Kummer, and Oliver Lorscheid.

I will exposit some recent joint work with Paul Larson and Grigor Sargsyan that uses higher models of the Axiom of Determinacy---models with nontrivial structure above $\Theta$, the least ordinal which is not the surjective image of the reals---to show that instances of the fundamental problem of inner model theory, the iterability conjecture, consistently fail.

In recent joint work with Pablo Cubides Kovacsics and Jinhe Ye on beautiful pairs in the unstable context, the amalgamation property (AP) for the class of global definable types plays a key role. In the talk, we will first indicate some important cases in which AP holds, and we will then present the construction of examples of theories, obtained in joint work with Rosario Mennuni, where AP fails.

(Joint work with S. Montenegro)

The striking resemblance between the behaviour of pseudo-algebraically closed, pseudo real closed and pseudo p-adically fields has lead to numerous attempts at describing their properties in a unified manner. In this talk I will present another of these attempts: the class of pseudo-T-closed fields, where T is an enriched theory of fields. These fields verify a « local-global » principle with respect to models of T for the existence of points on varieties. Although it very much resembles previous such attempts, our approach is more model theoretic in flavour, both in its presentation and in the results we aim for.

The first result I would like to present is an approximation result, generalising a result of Kollar on PAC fields, respectively Johnson on henselian fields. This result can be rephrased as the fact that existential closeness in certain topological enrichments come for free from existential closeness as a field. The second result is a (model theoretic) classification result for bounded pseudo-T-closed fields, in the guise of the computation of their burden. One of the striking consequence of these two results is that a bounded perfect PAC field with n independent valuations has burden n and, in particular, is NTP2.

We prove that any adjoint Chevalley group over an arbitrary commutative ring is regularly bi-interpretable with this ring. The same results hold for central quotients of arbitrary Chevalley groups and for Chevalley groups with bounded generation.
Also, we show that the corresponding classes of Chevalley groups (or their central quotients) are elementarily definable and even finitely axiomatizable.

A structure is omega-categorical if its theory has a unique countable model (up to isomorphism). We will survey some old results concerning the Apps-Wilson structure theory for omega-categorical groups and state a conjecture of Wilson from the 80s on omega-categorical characteristically simple groups. We will also discuss the analogous of Wilson’s conjecture for Lie algebras and present some connections with the restricted Burnside problem.

I am going to discuss main results of my paper "Physics over a finite field and Wick rotation", arxiv 2306.15698. It introduces a structure over a pseudo-finite field which might be of interest in Foundations of Physics. The main theorem establishes an analogue of the polar co-ordinate system in the pseudo-finite field. A stability classification status of the structure is an open question.

Positive logic is a generalisation of full first-order logic, where negation is not built in, but can be added as desired. In joint work with Jan Dobrowolski we succesfully generalised the recent development on Kim-independence in NSOP1 theories to the positive setting. One of the important theorems in this development is the independence theorem, whose statement is very similar to the well-known statement for simple theories, and allows us to amalgamate independent types. In this talk we will have a closer look at the proof of this theorem, and what needs to be changed to make the proof work in positive logic compared to full first-order logic.