University of Oxford

The lambda-calculus was invented to formalise arithmetic by encoding numbers and operations as abstract functions. We will introduce the lambda-calculus and present two encodings of modular arithmetic: the first is a recipe to quotient your favourite numeral system, and the second is purpose-built for modular arithmetic. A highlight of the second approach is that it does not require recursion i.e., it is defined without fixed-point operators. If time allows, we will also give an implementation of the Chinese remainder theorem which improves computational efficiency. 

I will sketch a proof of the statement in the title and outline how it is related to Ehrenfeucht–Fraïssé games on C*-algebras. I will provide the relevant background on C*-algebras (and descriptive set theory) and explain how to construct a standard Borel category X that can play a role of their `moduli'. The theorem from the title is an application of the compactness theorem, for a suitable first-order theory whose models correspond to functors from X. If time permits, I will mention some related problems and connections with conceptual completeness for infinitary logic. This talk is based on several discussions with Ehud Hrushovski, Jennifer Pi, Mira Tartarotti, and Stuart White after a reading group on the paper "Games on AF-algebras" by Ben De Bondt, Andrea Vaccaro, Boban Velickovic and Alessandro Vignati.

I will talk about preliminaries in Arakelov geometry. Also, a historical overview will be provided. This talk will be the basis of a later talk about the theory of globally valued fields.

A subset $A$ of $A_n$ is $k$-product-free if for all $a_1,a_2,\dots,a_k\in A$, $a_1a_2\dots a_k$ $\notin A$.
We determine the largest $3$-product-free and $4$-product-free subsets of $A_n$ for sufficiently large $n$. We also obtain strong stability results and results on multiple sets with forbidden cross products. The principal technical ingredient in our approach is the theory of hypercontractivity in $S_n$. Joint work with Peter Keevash.

Dirichlet polynomials are useful in the study of the Riemann zeta function & Dirichlet L functions, serving as approximations to them via the approximate functional equation. Understanding how often they can be large gives bounds on the number of zeroes of these functions in vertical strips - known as zero density estimates - which are relevant to the distribution of primes in short intervals. Based on Guth-Maynard, we study large values of Dirichlet polynomials with characters, relevant to Dirichlet L functions. Joint work with Yung Chi Li. 

Given a mod $p$ Galois representation, one often wonders whether it arises by reducing a $p$-adic one, and whether these lifts are suitably 'well-behaved'. In this talk, we discuss how ideas from homotopy theory aid the study of Galois deformations, reviewing work of Galatius-Venkatesh.

In recent joint work with J. Merikoski, we developed a new way to employ $\mathrm{SL}_2(\mathbb{R})$  spectral methods to number-theoretical counting problems, entirely avoiding Kloosterman sums and the Kuznetsov formula. The main result is an asymptotic formula for an automorphic kernel, with error terms controlled by two new kernels. This framework proves particularly effective when averaging over the level and leads to improvements in equidistribution results involving quadratic polynomials. In particular, we show that the largest prime divisor of $n^2 + h$ is infinitely often larger than $n^{1.312}$, recovering earlier results that had relied on the Selberg eigenvalue conjecture. Furthermore, we obtain, for the first time in this setting, strong uniformity in the parameter $h$.
 

I will construct a fully-faithful functor from the category of co-admissible D-cap modules of Ardakov—Wadsley, to the category of quasi-coherent sheaves on the "analytic de Rham space”, at least in the case when the rigid variety is affinoid and étale over a polydisk.