We generalize the fact that all graphs omitting a fixed finite bipartite graph can be uniformly approximated by rectangles (Alon-Fischer-Newman, Lovász-Szegedy), showing that hypergraphs omitting a fixed finite $(k+1)$-partite $(k+1)$-uniform hypergraph can be approximated by $k$-ary cylinder sets. In particular, in the decomposition given by hypergraph regularity one only needs the first $k$ levels: such hypergraphs can be approximated using sets of vertices, sets of pairs, and so on up to sets of $k$-tuples, and on most of the resulting $k$-ary cylinder sets, the density is either close to 0 or close to 1. Moreover, existence of such approximations uniformly under all measures on the vertices is a characterization. Our proof uses a combination of analytic, combinatorial and model-theoretic methods, and involves a certain higher arity generalization of the epsilon-net theorem from VC-theory.  Joint work with Henry Towsner.

The Schmidt subspace theorem is a far-reaching generalization of the Thue-Siegel-Roth theorem in diophantine approximation. In this talk I will give an interpretation of Schmidt's subspace theorem in terms of the dynamics of diagonal flows on homogeneous spaces and describe how the exceptional subspaces arise from certain rational Schubert varieties associated to the family of linear forms through the notion of Harder-Narasimhan filtration and an associated slope formalism. This geometric understanding opens the way to a natural generalization of Schmidt's theorem to the setting of diophantine approximation on submanifolds of $GL_d$, which is our main result. In turn this allows us to recover and generalize the main results of Kleinbock and Margulis regarding diophantine exponents of submanifolds. I will also mention an application to diophantine approximation on Lie groups. Joint work with Nicolas de Saxcé.

In 1966 Chen Jingrun showed that every large even integer can be written as the sum of two primes or the sum of a prime and a semiprime. To date, this weakened version of Goldbach's conjecture is one of the most remarkable results of sieve theory. I will talk about the big ideas which paved the way to this proof and the ingenious trick which led to Chen's success. No prior knowledge of sieve theory required – all necessary techniques will be introduced in the talk.

We will discuss the problem of deciding (algorithmically) whether a variety over a local field K has a K-rational point, surveying some known results. I will then allow K to be an infinite extension (of some arithmetic interest) of a local field and present some recent work.
 

Let C be an elliptic or hyperelliptic curve over a p-adic field K. Then C is equipped with a Galois representation, given by the action of the absolute Galois group of K on the Tate module of C. The behaviour of this representation depends on the reduction type of C. We will focus on the case of C having bad reduction, and acquiring potentially good reduction over a wildly ramified extension of K. We will show that, if C is an elliptic curve, the Galois representation can be completely determined in this case, thus allowing one to fully classify Galois representations attached to elliptic curves. Furthermore, the same can be done for a special family of hyperelliptic curves, obtaining a result which is surprisingly similar to that for the corresponding elliptic curves case.
 

We will survey an analogy between random integers and random permutations, which goes back to works of Erdős and Kac and of Billingsley.
This analogy inspired results and proofs about permutations, originating in the setting of integers, and vice versa.
Extensions of this analogy will be described, involving the generalized Ewens measure on permutations, based on joint work with D. Elboim.
If time permits, an analogous analogy, this time between random polynomials over a finite field and random permutations, will be discussed and formalized, with some applications.
 

Chowla's conjecture from the 1960s is the assertion that the Möbius function does not correlate with its own shifts. I'll discuss some recent works where with collaborators we have made progress on this conjecture.

In this talk, I will talk about two seemingly disjoint topics - Vinogradov’s mean value theorem, a classically important topic of study in additive number theory concerning solutions to a specific system of diophantine equations, and Incidence geometry, a collection of combinatorial results which focus on estimating the number of incidences between an arbitrary set of points and curves. I will give a brief overview of these two topics along with some basic proofs and applications, and then point out how these subjects connect together.

Local-to-global principles are a key tool in arithmetic geometry. Through a theorem of Siegel on representations of totally positive numbers as sums of squares in number fields we give a concrete introduction to the Hasse principle, and briefly talk about other local-to-global principles. No prerequisites from algebraic number theory are assumed, although some familiarity is helpful for context.