University of Oxford

Profinite rigidity is essentially the study of which groups can be distinguished from each other by their finite quotients. This talk is meant to give a gentle introduction to the area - I will explain which questions are the right ones to ask and give an overview of some of the main results in the field. I will assume knowledge of what a group presentation is.

Since Segal's formulation of axioms for 2d CFTs in the 80s, it has remained a major problem to construct examples of CFTs that satisfy the axioms.

I will report on ongoing joint work with James Tener in that direction.

Let $X$ denote an open subset of $\mathbb{C}^d$, and $\mathcal{O}$ its sheaf of holomorphic functions. In the 1970’s, Ishimura studied the morphisms of sheaves $P\colon\mathcal{O}\to\mathcal{O}$ of $\mathbb{C}$-vector spaces which are continuous, that is the maps $P(U)\colon\mathcal{O}(U)\to\mathcal{O}(U)$ on the sections are continuous. In this talk, we explain his result, and explore its analogues in the non-Archimedean world.

The canonical dimension is a fundamental integer-valued invariant that is attached to mod p representations of p-adic Lie groups. I will explain why it is both an asymptotic measure of growth, and an algebraic quantity strongly related to Krull dimension. We will survey algebraic tools that can be applied in its calculation, and describe results spanning the last twenty years. I'll present a new theorem and suggest its possible significance for the mod p local Langlands programme. 

Waldspurger proved maximality and minimality results for certain generalised Springer representations of $\text{Sp}(2n,\mathbb{C})$. We will discuss analogous results for $G = \text{SO}(N,\mathbb{C})$ and sketch their proofs.

Let $C$ be a unipotent class of $G$ and $E$ an irreducible $G$-equivariant local system on $C$. Let $\rho$ be the generalised Springer representation corresponding to $(C,E)$. We call $C$ the support of $\rho$. It is well-known that $\rho$ appears in the top cohomology of a certain variety. Let $\bar\rho$ be the representation obtained by summing the cohomology groups of this variety.

We show that if $C$ is parametrised by an orthogonal partition consisting of only odd parts, then $\bar\rho$ has a unique irreducible subrepresentation $\rho^{\text{max}}$ whose support is maximal among the supports of the irreducible subrepresentations of $\rho^{\text{max}}$. We also show that $\text{sgn}\otimes\rho^{\text{max}}$ is the unique subrepresentation of $\text{sgn}\otimes\bar\rho$ with minimal support. We will also present an algorithm to compute $\rho^{\text{max}}$.

In this talk we will present some work in progress generalising Lubin-Tate formal group laws to higher dimensions. There have been some other generalisations, but ours is different in that the ring over which the formal group law is defined changes as the dimension increases. We will state some conjectures about these formal group laws, including their relationship to the Drinfeld tower over the p-adic upper half plane, and provide supporting evidence for these conjectures.

An occupational hazard of mathematicians is the investigation of objects that are "optimal" in a mathematically precise sense, yet may be far from optimal in practice. This talk will discuss an extreme example of this effect: Gauss-Hermite quadrature on the real line. For large numbers of quadrature points, Gauss-Hermite quadrature is a very poor method of integration, much less efficient than simply truncating the interval and applying Gauss-Legendre quadrature or the periodic trapezoidal rule. We will present a theorem quantifying this difference and explain where the standard notion of optimality has failed.

For the first time, a method has become available for fast computation of near-best rational approximations on arbitrary sets in the real line or complex plane: the AAA algorithm (Nakatsukasa-Sète-T. 2018).  After a brief presentation of the algorithm this talk will focus on twenty demonstrations of the kinds of things we can do, all across applied mathematics, with a black-box rational approximation tool.
 

I will outline a new algorithm for unknot recognition that runs in quasi-polynomial time. The input is a diagram of a knot with n crossings, and the running time is n^{O(log n)}. The algorithm uses hierarchies, normal surfaces and Heegaard splittings.