University of Oxford

Let $G$ be a $p$-adic Lie group. From the perspective of $p$-adic manifolds, possibly the most natural $p$-adic representations of $G$ to consider are the locally analytic ones.  Motivated by work of Pan, when $G$ acts on a rigid analytic variety $X$ (e.g., the flag variety), we would like to geometrise locally analytic $G$-representations, via a covariant localisation theory which should intertwine Schneider-Teitelbaum's duality with the $p$-adic Beilinson-Bernstein localisation. I will report some partial progress in the simplified situation when we replace $G$ by its germ at $1$. The main ingredient is an infinite jet bundle $\mathcal{J}^\omega_X$ which is dual to $\widehat{\mathcal{D}}_X$. Our "co"localisation functor is given by a coinduction to $\mathcal{J}^\omega_X$. Work in progress.

Perverse sheaves are an indispensable tool in geometric representation theory that can be used to construct representations and compute composition multiplicities. These ‘sheaves’ live in a certain $\ell$-adic derived category. In this talk we will discuss a beautiful construction of this category based on the pro-étale topology and explore some applications in representation theory.

Geometric (even combinatorial) group theory suffers from the unfortunate situation that many obvious questions about group presentations (ex: is this a presentation of the trivial group? is this word the identity in that group?) cannot be answered. Not only "we don't know how to tell" but "we know that we cannot know how to tell" - this is called undecidability. This talk will serve as an introduction (for non-experts, since I am also such) to the area of group theoretic decision problems: I'll aim to cover some problems, some solutions (or half-solutions) and some of the general sources of undecidability, as well as featuring some of my (least?) favourite pathological groups.

Given a mathematical object, what can you compute about it? In some settings, you cannot say very much. Given an arbitrary group presentation, for example, there is no procedure to decide whether the group is trivial. In 3-manifolds, however, algorithms are a fruitful and active area of study (and some of them are even implementable!). One of the main tools in this area is normal surface theory, which allows us to describe interesting surfaces in a 3-manifold with respect to an arbitrary triangulation. I will discuss some results in this area, particularly around Seifert fibered spaces.

A fundamental result in 3-manifold topology is the loop theorem: Given a null-homotopic simple closed curve in the boundary of a compact 3-manifold $M$, it bounds an embedded disk in $M$. The standard topological proof of this uses the tower construction due to Papakyriakopoulos. In this talk, I will introduce basic existence and regularity results on minimal surfaces, and show how to use the tower construction to prove a geometric version of the loop theorem due to Meeks--Yau: Given a null-homotopic simple closed curve in the boundary of a compact Riemannian 3-manifold $M$ with convex boundary, it bounds an embedded disk of least area. This also gives an independent proof of the (topological) loop theorem.

Group cohomology is a powerful tool which has found many applications in modern group theory. It can be calculated and interpreted through geometric, algebraic and topological means, and as such it encodes the relationships between these different aspects of infinite groups. The aim of this talk is to introduce a circle of ideas which link group cohomology with the theory of BNS invariants, and the property of being subgroup separable. No prior knowledge of any of these topics will be assumed.

Condensed Mathematics is a tool recently developed by Clausen and Scholze and it is proving fruitful in many areas of algebra and geometry. In this talk, we will cover the definition of condensed sets, the analogues of topological spaces in the condensed setting. We will also talk about condensed modules over a ring and some of their nice properties like forming an abelian category. Finally, we'll discuss some recent results that have been obtained through the application of Condensed Mathematics.

Correlation operators are used in data assimilation algorithms
to weight the contribution of prior and observation information.
Efficient implementation of these operators is therefore crucial for
operational implementations. Diffusion-based correlation operators are popular in ocean data assimilation, but can require a large number of serial matrix-vector products. An all-at-once formulation removes this requirement, and offers the opportunity to exploit modern computer architectures. High quality preconditioners for the all-at-once approach are well-known, but impossible to apply in practice for the
high-dimensional problems that occur in oceanography. In this talk we
consider a nested preconditioning approach which retains many of the
beneficial properties of the ideal analytic preconditioner while
remaining affordable in terms of memory and computational resource.

The Riemann hypothesis (RH) is one of the great open problems in
mathematics. It arose from the study of prime numbers in an analytic
context, and—as often occurs in mathematics—developed analogies in an
algebraic setting, leading to the influential Weil conjectures. RH for
curves over finite fields was proven in the 1940’s by Weil using
algebraic-geometric methods, and later reproven by Stepanov and
Bombieri by elementary means. In this talk, we use RH for curves to
prove the Weil bound for certain (Kloosterman) exponential sums, which
in turn is a fundamental tool in the study of prime numbers.