We survey the life of a Turing pattern, from initial diffusive instability through the emergence of dominant spatial modes and to an eventual spatially heterogeneous pattern. While many mathematically ideal Turing patterns are regular, repeating in structure and remaining of a fixed length scale throughout space, in the real world there is often a degree of irregularity to patterns. Viewing the life of a Turing pattern through the lens of spatial modes generated by the geometry of the bounded space domain housing the Turing system, we discuss how irregularity in a Turing pattern may arise over time due to specific features of this space domain or specific spatial dependencies of the reaction-diffusion system generating the pattern.

I’ll discuss a top down example of holography at zero ’t Hooft coupling. The gauge side is self-dual N=4 SYM, whilst the gravitational side is the closed topological B-model on a certain Calabi-Yau 7-fold that fibres over twistor space. As an application, I’ll discuss an interpretation of correlation functions of certain determinant operators in sI’ll discuss a top down example of holography at zero ’t Hooft coupling. The gauge side is self-dual N=4 SYM, whilst the gravitational side is the closed topological B-model on a certain Calabi-Yau 7-fold that fibres over twistor space. As an application, I’ll discuss an interpretation of correlation functions of certain determinant operators in self-dual SYM in terms of giant graviton D-branes on this 7-fold.elf-dual SYM in terms of giant graviton D-branes on this 7-fold.

Joint with Atul Sharma arxiv:2512.04152.

I will present joint work with M. Botnan, S. Oppermann, and J. Steen on multiparameter persistent homology in degree zero. It is known that arbitrary diagrams of vector spaces and linear maps can be realized as homology of diagrams of simplicial complexes in some positive degree. We study the more restrictive case of degree zero, which corresponds to diagrams freely generated from sets and set maps. Despite their seemingly simple combinatorial nature, a full understanding of the structure of these representations remains elusive. I will summarize our findings and discuss some conjectures.

In this week's Fridays@2, a panel of representatives from a range of companies who employ mathematics graduates will be here to answer your questions.A degree in mathematics opens doors far beyond academia, but what do those paths really look like? Join us for a panel event bringing together mathematicians working across Finance, Digital Services, Technology, Consulting, Data Analytics, and Teaching.

Our speakers will share their career journeys, how they moved from studying mathematics into industry roles, and what their day to day work involves. This is your opportunity to gain insight into the skills employers value, the challenges and opportunities in different sectors, and the many ways mathematical thinking shapes real world impact.

Whether you already have a clear goal or are still exploring your options, come along with your questions and curiosity and discover where maths could take you.

In the first part of the talk, I will present an overview of recent advances in the description of diffusion-reaction processes and their first-passage statistics, with the special emphasis on the role of the boundary local time and related spectral tools. The second part of the talk will illustrate the use of these tools for the analysis of boundary-catalytic branching processes. These processes describe a broad class of natural phenomena where the population of diffusing particles grows due to their spontaneous binary branching (e.g., division, fission, or splitting) on a catalytic boundary located in a complex environment. We investigate the possibility of the geometric control of the population growth by compensating the proliferation of particles due to catalytic branching events by their absorptions in the bulk or on boundary absorbing regions. We identify an appropriate Steklov spectral problem to obtain the phase diagram of this out-of-equilibrium stochastic process. The principal eigenvalue determines the critical line that separates an exponential growth of the population from its extinction. In other words, we establish a powerful tool for calculating the optimal absorption rate that equilibrates the opposite effects of branching and absorption events and thus results in steady-state behavior of this diffusion-reaction system. Moreover, we show the existence of a critical catalytic rate above which no compensation is possible, so that the population cannot be controlled and keeps growing exponentially. The proposed framework opens promising perspectives for better understanding, modeling, and control of various boundary-catalytic branching processes, with applications in physics, chemistry, and life sciences.

Any two 1 by 1 real matrices commute.  This is in general not the case for 2 by 2 real matrices.  However, if A, B, C, and D are any 2 by 2 real matrices, then ABCD - ABDC - ACBD + ACDB + ADBC - ADCB - BACD + BADC + BCAD - BCDA - BDAC + BDCA + CABD - CADB - CBAD + CBDA + CDAB - CDBA - DABC + DACB + DBAC - DBCA - DCAB + DCBA = 0.  This identity is the first instance of a general result of Amitsur and Levitski; I will explain a simple graph-theoretic proof due to Swan.

In this talk we describe several aspects related to the theory of some anisotropic parabolic equations. The anisotropy shown in such equations will appear in the form of porous medium, in the fast and porous medium diffusion regime. In particular, we show the existence of selfsimilar fundamental solutions, which is uniquely determined by its mass, and the asymptotic behaviour of all finite mass solutions in terms of the family of self-similar fundamental solutions. Time decay rates are derived as well as other properties of the solutions, like quantitative boundedness, positivity and regularity. 

The investigation of both models are objects of joint works with F. Feo and J. L. V´azquez.

Recent years have seen the expansion of the traditional notion of symmetry in quantum theory to so-called generalised or categorical symmetries, which may in particular be non-invertible. This seems to be at odds with Wigner's theorem, which asserts that quantum symmetries ought to be implemented by (anti)unitary -- and hence invertible -- operators on the Hilbert space. In this talk, we will try to resolve this puzzle for generalised symmetries that are described by (higher) fusion categories. After giving a gentle introduction to the latter, we will discuss how one can associate an inner-product-preserving operator to (possibly non-invertible) symmetry defects and illustrate our construction through concrete examples. Based on the recent work 2602.07110 with Gai and Schäfer-Nameki.

Koszul algebras are positively graded algebras with very amenable homological properties. Typical examples include the polynomial ring over a field or the exterior and symmetric algebras of a vector space. A category is called Koszul if it has a grading with which it is equivalent to the category of graded modules over a Koszul algebra. A famous example (due to Soergel) is the principal block of category $\mathcal{O}$ for a semisimple Lie algebra. Koszulity is a very nice property, but often very difficult to check. In this talk, Thorsten Heidersdorf (Newcastle University) will give a criterion that allows to check Koszulity in case the category is a graded semi-infinite highest weight category (which is a structure that appears often in representation theory). This is joint work with Jonas Nehme and Catharina Stroppel.

Thompson’s groups, introduced by Thompson in 1965, have had a lot of attention in the last fifty years. Being finitely presented, a natural question is to compute their Dehn function. All three groups are conjectured to have quadratic Dehn function; this conjecture was confirmed for Thompson’s group 𝐹 by Guba in 2006. During Matteo Migliorini's talk, we show how to deduce from Guba’s result that Thompson’s group 𝑇 has a quadratic Dehn function as well.

I will discuss some recent progress on the Donaldson Segal programme, and in particular how calibrated cycles (coassociative submanifolds, special Lagrangians) arise from the large mass limit of $G_2$ and Calabi Yau monopoles.

Random walks on graphs can mix slowly. To speed it up, imagine that at each step instead of choosing the neighbor at random, there is a small probability $\varepsilon > 0$ that we can choose it. We show that in this case, at least for graphs of bounded degree, there is a way to steer the walk so that we visit every vertex in $n^{1+o(1)}$ many steps. The key to this result is a way to decompose arbitrary graphs into small-diameter pieces.

Graph products of groups were introduced by Green as a construction that encompasses both direct products and free products. Likewise, the notion of graph product of von Neumann algebras, introduced by Caspers and Fima, recovers both tensor products and free products. Camille Horbez will present rigidity theorems for graph products of tracial von Neumann algebras, and discuss the computation of their symmetries, drawing parallels with the case of groups. This is a joint work with Adrian Ioana. 

(Joint seminar with Random Matrix Theory)

I will discuss a 2-dimensional model of random walk in random environment known as line model. The environment is described by two independent families of i.i.d. random variables dictating rates of jumps in vertical, respectively horizontal directions, and whose values are constant along vertical, respect. horizontal lines. When jump rates are heavy-tailed in one of the directions, the random walk becomes superdiffusive in that direction, with an explicit scaling limit written as a two-dimensional Brownian motion time-changed (in one of the components) by a process introduced by Kesten and Spitzer in 1979. I will present ideas of the proof of this result, which relies on appropriate time-change arguments.  In the case of a fully degenerate environment, I will present a sufficient condition for non-explosion of the process (which is also believed to be sharp), as well as conjectures on the associated scaling limit.

This is based on joint work with J.-D. Deuschel (TU Berlin). 

In this talk I will present a few topics of recent interest that centre around the theme of “driven interfacial hydrodynamics”: fluid mechanical systems in which droplets and particles are self-propelled through interaction with the environment. I will also present some very recent work on using differentiable physics (a branch of physics-informed machine learning) to determine constitutive relations for highly plasticised metals.

This talk will contain elements of fluid dynamics, experimental mechanics, dynamical systems, statistical physics, and machine learning.

Neurons interact via spikes, which is a pulse-like, discontinuous mechanism. Their mean-field PDE description gives Fokker-Planck equations with novel nonlinearities. From a probability point of view, these give rise to Mckean-Vlasov equations involving hitting times. Similar mechanisms also arise in models for systemic risk in mathematical finance, and the supercooled Stefan problem. In this talk, we will first present models for spiking neurons: both microscopic particle models and macroscopic PDE models, with an emphasis on the general mathematical structure. A central question for these equations is the finite-time blow-up of the firing rate, which scientifically corresponds to the synchronization of a neuronal network. We will discuss how to continue the solution physically after the blow-up, by introducing a new timescale. The new timescale also helps us to understand the long term behavior of the equation, as it reveals a hidden contraction structure in the hyperbolic case. Finally, we will present a recently developed numerical solver based on this framework. Numerical tests show that during the synchronization the standard microscopic solver suffers from a rather demanding time step requirement, while our macro-mesoscopic solver does not.

Timely optimization problems are high-dimensional, calling for dimensionality reduction techniques to solve them efficiently. The random embedding strategy, which optimizes the objective along a low-dimensional subspace of the search space, is arguably the simplest possible dimensionality reduction method. Recent works quantify the probability of success of this strategy to solve the original problem by lower bounding the probability of a random subspace to intersect the set of approximate global minimizers. These works showed that, when the objective has low effective dimension (i.e., is only varying along a low-dimensional subspace of the search space), random embeddings of sufficiently large dimension solve the original high-dimensional problem with probability one. In this work, we relax the low effective dimension assumption by considering objectives with anisotropic variability, namely, Lipschitz continuous functions whose Lipschitz constant is small (though nonzero) when the function is restricted to a high-dimensional subspace. Exploiting tools from stochastic geometry, we lower bound the probability for a random subspace to intersect the set of approximate global minimizers of these objectives, hence, the probability of random embeddings to succeed in solving (approximately) the original global optimization problem. Our findings offer deeper insights into the role of the dimension of the optimization problem in this probability of success.

TBA

Over 30 years has passed since the original proof of Fermat's Last Theorem by Wiles and Taylor—Wiles. There are now several proofs known to humanity, and I'm currently teaching one of them to a computer. This made me try to find out what the most ergonomic route was nowadays, and I found it by asking Richard Taylor what it was. In the talk I will summarise how to prove Fermat's Last Theorem in 2026, highlighting the differences between the modern method and the original route discovered by Wiles (we do use p=3, but in a different way). I won't talk much at all about Lean and essentially none of the work I will present is my own; this will just be a standard number theory seminar, and probably everything in it will already be known to the experts, but hopefully younger people will learn something.

Graph causal optimal transport is a recent generalisation of causal optimal transport in which the allowed couplings satisfy causal restrictions given by a directed graph. Inspired by applications to structural causal models, it was originally introduced in Eckstein and Cheridito (2023). We study fundamental properties of graph causal optimal transport, with a particular focus on its induced Wasserstein distance. Our main result is a full characterisation of the directed graphs for which this associated Wasserstein distance is indeed a metric, an open problem in the original paper. We fully characterise the gluing properties of graph causal couplings, prove denseness of Monge maps, and provide a dynamic programming principle. Finally, we present an application to continuity of stochastic team problems. Based on joint work with Jan Obloj.

Gaussian fields arise in a variety of contexts in both pure and applied mathematics. While their geometric properties are well understood, their topological features pose deeper mathematical challenges. In this talk, I will begin by highlighting some motivating examples from different domains. I will then outline the classical theory that describes the geometric behaviour of Gaussian fields, before turning to more recent developments aimed at understanding their topology using the Wiener chaos expansion.

to follow

to follow

The Bogomolov-Miyaoka-Yau inequality for minimal compact complex surfaces of general type was proved in 1977 independently by Miyaoka, using methods of algebraic geometry, and by Yau, as an outgrowth of his proof of the Calabi conjectures. In this talk, we outline our program to prove the conjecture that symplectic 4-manifolds with $b^+>1$ obey the Bogomolov-Miyaoka-Yau inequality. Our method uses Morse theory on the gauge theoretic moduli space of non-Abelian monopoles, where the Morse function is a Hamiltonian for a natural circle action and natural two-form.  We shall describe generalizations of Donaldson’s symplectic subspace criterion (1996) from finite to infinite dimensions. These generalized symplectic subspace criteria can be used to show that the natural two-form is non-degenerate and thus an almost symplectic form on the moduli space of non-Abelian monopoles. This talk is based on joint work with Tom Leness and the monographs https://arxiv.org/abs/2010.15789  (to appear in AMS Mathematical Surveys and Monographs), https://arxiv.org/abs/2206.14710 and https://arxiv.org/abs/2410.13809. 

to follow

Arham Farid (MI EDI Officer) will join us to chat about current EDI initiatives and to hear our thoughts about ways EDI can improve in the Maths Institute.