Past

A test case for the Langlands functoriality principle is the tensor product lifting of automorphic representations of $\mathrm{GL}(m) \times \mathrm{GL}(n)$ to automorphic representations of $\mathrm{GL}(mn)$. This has been established in several key instances: for $m=n=2$ by Ramakrishnan (2000), for $m=2$ and $n=3$ by Kim-Shahidi (2002), and more recently for $m=2$ and arbitrary $n$ over $\mathbb{Q}$ by Arias-de-Reyna-Dieulefait-Pérez (2025) under certain assumptions, including that the $\mathrm{GL}(2)$ factor has level 1. I will discuss some new results in the case of $\mathrm{GL}(2) \times \mathrm{GL}(n)$, as well as ideas for how to go further, when $m>2$, using a p-adic propagation technique introduced by Newton-Thorne (2021).

Professor Tobias Weinzierl will be talking about: 'Modern tasking approaches to simulate black holes (and other interesting phenomena): How can we make them fit to modern hardware?'

Over the past decade, my team has developed a simulation code for binary black hole mergers that runs on dynamically adaptive Cartesian meshes. 
Its dynamic adaptivity, coupled with multiple numerical schemes operating at different scales and non-deterministic loads from puncture sources, makes task-based parallelisation a natural choice:
Task stealing across fine-grained work units balances the load across many CPU cores, while treating tasks as atomic compute units should---in theory---allow us to deploy seamlessly to accelerators. In practice, it is far from straightforward.

Fine-grained tasks clash with accelerators, which thrive on large, homogeneous data access patterns;
task bursts on the CPU overwhelm tasking systems and produce suboptimal execution schedules;
and when tasks span address spaces, expensive memory movements kill performance.
Surprisingly, many mainstream tasking frameworks even lack the features our domain demands, i.e. to express key task concepts.
Our application serves as a powerful lens for examining these challenges. 
While our code base extends to other wave phenomena, Lagrangian techniques, and multigrid solvers, they all reveal the same fundamental tension: 
modern hardware increasingly struggles to accommodate modern HPC concepts, and it even challenges the notion that one solution fits all hardware components.
The talk proposes practical workarounds and solutions to these shortcomings, while all solutions are designed, wherever possible, to be upstreamed into mainstream software building blocks or at least decoupled from our particular PDE solver, making them broadly applicable to the community.

This talk is hosted by Rutherford Appleton Laboratory and will take place @ Harwell Campus, Didcot, OX11 0QX
 

In an AdS compactification the no-scale-separation conjecture states that the AdS scale cannot be parametrically separated from the KK scale of the internal manifold. This calls into question the validity of the effective lower-dimensional theory whilst also making holographic duals more complicated: obtaining a dense spectrum of low-dimension operators which are strongly mixed. This also poses problems for constructing de-Sitter vacua. 
I will discuss the papers Holography vs Scale Separation, Holographic Constraints on the String Landscape and A Holographic Constraint on Scale Separation which use holography to find constraints on scale separation, with the latter two papers focussing DGKT. 

Charles Parker II will be talking about: 'Structure-preserving finite elements and the convergence of augmented Lagrangian methods'

Problems with physical constraints, such as the incompressibility constraint for mass conservation in fluids or Gauss's laws for electric and magnetic fields, result in generalized saddle point systems. So-called structure-preserving finite elements respect the constraints pointwise, resulting in more physically accurate solutions that are typically robust with respect to some problem parameters. However, constructing these finite elements may involve complicated spaces for the Lagrange multiplier variables. Augmented Lagrangian methods (ALMs) provide one process to compute the solution without the need for an explicit basis for the Lagrange multiplier space. In this talk, we present new convergence estimates for a standard ALM method, sometimes called the iterated penalty method, applied to structure-preserving discretizations of linear saddle point systems.

Existential decidability of a ring is the question as to whether an algorithm exists which determines whether a given system of polynomial equations and inequations has a solution. It is a classical result (``Hilbert's 10th problem'') that the ring of integers is not existentially decidable. Over the years there has been many results related to Hilbert 10th problem over different fields. For instance, the existential decidability of a Henselian valued field of mixed characteristic and finite ramification can be reduced to the positive existential decidability of its residue field, plus some additional structure.

An example of a mixed characteristic Henselian field is the fraction field of Witt Vectors. It is a construction analogous to the construction of the p-adic numbers from $\mathbb{F}_p$, and it takes a perfect field $F$ of characteristic $p$ and constructs a field with value group $\mathbb{Z}$ and residue field $F$. We will look at the existential decidability of the Henselian valued fields arising from finite extensions of the Witt vectors over a positive characteristic Henselian valued field. I will report on our progress so far, the problems that we have encountered, and the goals we are working toward.

Skein lasanga modules are a smooth 4-manifold invariant that was introduced by Morrison, Walker and Wedrich using Khovanov homology. This invariant was recently used by Ren and Willis to give the first analysis free proof of the existence of exotic 4-manifolds. However, even for simple handlebodies it remains difficult to compute. A generalisation was introduced by Chen using Knot Floer homology, which in principle should be easier to compute due to cabling formulas for knot Floer homology. I will give a general introduction to lasagna modules assuming no knowledge of Khovanov or knot Floer homology, and then explain some methods, from upcoming work, for computing Floer Lasagna modules.

Between 1969 and 1974, Doplicher, Haag and Roberts published a series of papers, studying the structure of the algebra of observables of general QFTs. Only very recently did those ideas get adapted to the study of discrete systems, or quantum lattice systems.

In this talk, mostly based on Corey Jones' original paper (arXiv 2304.00068), I will give an overview of the mathematical machinery behind what he called "discrete DHR theory". I will also present some of the main results that have been developed in this formalism: a new tool for the study of Quantum Cellular Automata, and a SymTFT-like construction for discrete systems.

I will present a generalisation of Mirzakhani’s recursion for the volumes of moduli spaces of bordered Klein surfaces, including non-orientable surfaces. On these moduli spaces, the top form introduced by Norbury diverges as the lengths of one-sided geodesics approach zero. However, integrating this form over Gendulphe’s regularised moduli space—where the systole of one-sided geodesics is bounded below by epsilon—yields a finite volume. Using Norbury’s extension of the Mirzakhani–McShane identities to the non-orientable setting, we derive an explicit formula for the volume of the moduli space of one-bordered Klein bottles, as well as a recursion for arbitrary topologies that fully captures the dependence on the geometric regularisation parameter epsilon. I will conclude with remarks on the relation to refined topological recursion, which leads us to a refinement of the Witten–Kontsevich recursion and of the Harer–Zagier formula for the orbifold Euler characteristic of the moduli space of curves of genus g with n marked points. Based on joint work with P. Gregori and K. Osuga; the final part reflects ongoing work with N. Chidambaram, A. Giacchetto, and K. Osuga.

The notion of invariant random subgroups (IRS) is a fruitful, well-studied concept in dynamics on groups. In this talk, Hanna Oppelmayer will explain what it is and how to extend this notion to group von Neumann algebras LG, where G is a discrete countable group. We call it invariant random sub-von Neumann algebra (IRA). As an application, Hanna will provide a result concerning amenable IRAs, which generalises (in the discrete setup) a theorem of Bader-Duchesne-Lécureux about amenable IRSs. This is joint work with Tattwamasi Amrutam and Yair Hartman.

Frobenius’ theorem in differential geometry asserts that, given a smooth manifold $M,$ every involutive subbundle $E \subset T_M$ determines a decomposition of $M$ into smooth leaves tangent to $E$. I will explain an infinitesimal analogue of this integration phenomenon for suitably nice schemes over coherent base rings, and then discuss an application. This talk is based on joint work with Magidson and Nuiten and ties into the work of Jiaqi Fu.

The quasi-isometry group QI(X) of a metric space X is a natural group of automorphisms of the space that preserve its large-scale structure. The quasi-isometry groups of most familiar spaces are usually enormous and quite wild. Spaces X for which QI(X) is understood tend to exhibit a sort of rigidity phenomenon: every quasi-isometry of such spaces is close to an isometry. We exploit this phenomenon to address the question of which abstract groups arise as the quasi-isometry groups of metric spaces. This talk is based on joint work with Paula Heim and Joe MacManus.

Since the foundational works of Diaconis, pointwise character bounds of the form $\chi(\sigma) \le \chi(1)^\alpha$ have guided the study of growth in finite simple groups. However, this classical machinery hits an algebraic bottleneck when confronted with non-class functions and unstructured subsets.

In this talk, we bypass this barrier by replacing classical representation theory with discrete analysis. By decomposing functions as $f = \sum f_\rho$ and bounding the $L_2$ norm $\|f_\rho\|_2 \le \chi_\rho(1)^\alpha$ for each representation $\rho$, we develop a robust theory of Fourier anti-concentration. We will demonstrate how this resolves the Liebeck–Nikolov–Shalev (LNS) conjecture—proving a group can be expressed optimally as the product of conjugates of an arbitrary subset $A$—and discuss how applying Boolean function analysis tools like hypercontractivity pushes this philosophy even further.

A difficult question in the local Langlands framework is to understand the interplay between the characters of irreducible smooth representations of a reductive group over a local field and the geometry of the dual space of Langlands parameters. An important invariant of the character (viewed as a distribution, i.e, a continuous linear functional on the space of smooth compactly supported functions) is the wavefront set, a measure of its singularities along with their directions. Motivated by the work of Adams, Barbasch, and Vogan for real reductive groups, it is natural to expect that the wavefront set is dual (in a certain sense) to the geometric singular support of the Langlands parameter. Dan Ciubotaru will give an overview of these ideas and describe recent progress in establishing a precise connection for representations of reductive p-adic groups. 

A spatial graph is a graph whose nodes and edges carry spatial attributes. It is a smart modelling choice for capturing the skeleton of a shape, a blood vessel network, a porous tissue, and many other data objects with intrinsically complex geometry, often resulting in graphs with a high node and edge count. In this talk, we introduce a topological spatial graph coarsening approach based on a new framework that balances graph reduction against the preservation of topological characteristics, essential for faithfully representing the underlying shape. To capture the topological information required to calibrate the reduction level, we adapt the construction of classical topological descriptors made for point clouds (the so-called persistence diagrams) to spatial graphs. This relies on a new filtration called triangle-aware graph filtration. Our coarsening approach is parameter-free and we prove that it is equivariant under rotations, translations, and scaling of the initial spatial graph. We evaluate the performance of our method on synthetic and real spatial graphs and show that it significantly reduces the graph sizes while preserving the relevant topological information.

 Hydrodynamics provides a universal low-energy effective description of interacting many-body systems. Traditionally, it is formulated in terms of equations of motion derived from the relevant conservation laws. However, this classical framework neglects fluctuations of hydrodynamic observables required by the fluctuation–dissipation theorem (FDT). The Schwinger–Keldysh effective field theory (SK EFT) offers a Wilsonian, action-based formulation of hydrodynamics that systematically incorporates such fluctuations. In this approach, the effective action is generically non-unitary (complex), encoding macroscopic dissipation, while the FDT is implemented through a discrete Kubo–Martin–Schwinger (KMS) symmetry. This symmetry also underlies the emergence of the second law of thermodynamics within hydrodynamics.

In this talk I will discuss recent work, with R. Tione, on the regularity of stationary points for a class of planar polyconvex integrands which are conformally-invariant, a natural assumption in view of geometric applications. We prove that, in two dimensions, stationary points are smooth away from a discrete set. We also show full C^1-regularity for orientation-preserving solutions, which appear naturally in minimization problems of Teichmüller type.

Deformation theory studies how varieties and other algebro-geometric objects vary in families. A central part of the subject is formal deformation theory, where one deforms over an Artinian base; such deformation problems are governed by Lie algebraic models. 

We pose the question of deforming varieties over nilpotent but not necessarily Artinian bases. These turn out to be classified by the same Lie algebraic models plus some topological structure. More precisely, we will consider partition Lie algebras in the category of ultrasolid modules, a variation of the solid modules of Clausen and Scholze that give a well-behaved category akin to topological modules.

To approach this result, we decompose deformation problems into n-nilpotent layers. Each of these layers is individually easier to understand, and is classified by simpler variants of partition Lie algebras.

We propose a novel Black-Scholes model under which the stock price processes are modeled by stochastic differential equations driven  by sub-diffusions. The new framework can capture the less financial activity phenomenon during the bear markets while having the classical Black-Scholes model as its special case. The sub-diffusive spot market is arbitrage-free but is in general incomplete. We investigate the pricing for European-style contingent claims under this new model. For this, we study the Girsanov transform for sub-diffusions and use it to find risk-neutral probability measures for the new Black-Scholes model. Finally, we derive the explicit formula for the price of European call options and show that it can be determined by a partial differential equation (PDE) involving a fractional derivative in time, which we coin a time-fractional Black-Scholes PDE.

Gravitational instantons are complete 4-dimensional hyperkähler manifolds with square-integrable curvature tensor. I will address the question whether all gravitational instantons (of type ALG) can be obtained as Hitchin moduli spaces. In particular, I will explain how to compute the (hyperkähler) Torelli map for (weakly) parabolic Higgs bundles on the 4-punctured sphere. This is based on recent joint work with Fredrickson, Mazzeo and Swoboda.

Descriptive set theory provides a useful framework for studying the complexity of classification problems in operator algebras. In this talk I will discuss how C*-algebras can be encoded as points in a Borel space, and introduce several equivalent parametrizations, including a new one in terms of ideals of a universal C*-algebra. I will then discuss examples of natural classes of C*-algebras that form Borel sets, as well as a parametrization of *-homomorphisms and recent results on the Borelness of certain functors. Time permitting, I will introduce KK-theory and the Kasparov product, and explain a new result showing that the Kasparov product is Borel in a certain appropriate parametrized setting.

Professor Amir Ali Ahmadi will talk about; 'Disjunctive Sum of Squares'

We introduce the concept of disjunctive sum of squares for certifying nonnegativity of polynomials. Unlike the popular sum of squares approach, where nonnegativity is certified by a single algebraic identity, the disjunctive sum of squares approach certifies nonnegativity using multiple algebraic identities. Our main result is a disjunctive Positivstellensatz showing that the degree of each algebraic identity can be kept as low as the degree of the polynomial whose nonnegativity is in question. Based on this result, we construct a semidefinite programming–based converging hierarchy of lower bounds for the problem of minimizing a polynomial over a compact basic semialgebraic set, in which the size of the largest semidefinite constraint remains fixed throughout the hierarchy. We further prove a second disjunctive Positivstellensatz, which leads to an optimization-free hierarchy for polynomial optimization. We specialize this result to the problem of proving copositivity of matrices. Finally, we describe how the disjunctive sum of squares approach can be combined with a branch-and-bound algorithm, and we present numerical experiments on polynomial, copositive, and combinatorial optimization problems. The talk is self-contained and assumes no prior background in sum of squares optimization.

The problem of stability of approximate homomorphisms was first posed by S. Ulam in the context of groups equipped with a metric. If $G$ and $H$ are groups and $H$ is equipped with a metric $d$, then $\varphi\colon G\to H$ is an $\varepsilon$-homomorphism if $d(\varphi(xy), \varphi(x)\varphi(y))\leq \varepsilon$ for all $x,y\in G$. Ulam’s well-studied problem asks how closely such a map can be approximated by a true homomorphism.
Analogous questions have been investigated in many algebraic and analytic settings. For C*-algebras, the notion of an $\varepsilon$-*-homomorphism admits several possible formalizations. The variant I will discuss, while perhaps not the most immediate, turns out to be particularly interesting, because its associated Ulam stability problem is closely related to rigidity for corona C*-algebras. Namely, Ulam stability of $\varepsilon$-*-isomorphisms between C*-algebras in a certain class (e.g., AF algebras) is equivalent to the rigidity question for coronas of direct sums of C*-algebras in this class.

 

We describe the solution to two problems concerning indefinite integral ternary quadratic forms. The first about anisotropic forms was popularized by Margulis following his solution of the Oppenheim Conjecture. The second about the density of isotropic forms was raised by Serre. Joint work with A. Gamburd, A. Ghosh and J. Whang.

I will start the talk by discussing renormlisation group in perturbative algebraic quantum field theory (pAQFT) and its non-perturbative incarnation acting on the Buchholz-Fredenhagen dynamical C*-algebra. I will also explain how pAQFT can be used to derive functional renormlisation group (FRG) equations that generalize Wetterich equations to globally hyperbolic Lorentzian manifolds and arbitrary states (beyond the usual FRG in the vacuum).

I will review how the large N expansion can be used in the context of the renormalisation group to probe some strongly coupled regimes. In particular, I will discuss a work by Gawedzki and Kupiainen where the authors study the three-dimensional non-Gaussian infrared fixed point of Phi^4 in the case of a hierarchical model of rank-one covariance, and explain how their approach could generalise to more realistic models. 

This is a joint work with Ajay Chandra.  

Dr Steph Foulds will talk about; 'Lazy Quantum Walks with Native Multiqubit Gates'

Quantum walks, the quantum analogue to the classical random walk, have been shown to deliver the Dirac equation in the continuum limit. Recent work has shown that 'lazy', open quantum walks can be mapped to computational methods for fluid simulation such as lattice Boltzmann method, quantum fluid dynamics, and smoothed-particle hydrodynamics. This work concerns evaluating the ability of near-term hardware to perform small, proof-of-concept quantum walks - but crucially with the inclusion of a rest state to encompass 'lazy' quantum walks, providing an integral step towards quantum walks for fluid simulation.

Neutral atom hardware is a promising choice of platform for implementing quantum walks due to its ability to implement native multiqubit gates and to dynamically re-arrange qubits. Using detail realistic modelling for near-term multiqubit Rydberg gates via two-photon adiabatic rapid passage, SPAM, and passive error, we present the gate sequences and final state fidelities for quantum walks with and without a rest state on 4 to 16-node rings. This, along with results of an error model with improved two- and three-qubit gate fidelities, leads us to conclude that a native four-qubit gate is required for the near-term implementation of interesting quantum walks on neutral atom hardware.

Please note; this talk is hosted by Rutherford Appleton Laboratory, Harwell Campus, Didcot, OX11 0QX

We will introduce a class of countable homeomorphism groups that share many properties with Thompson's group V, known as FSS* groups. This talk from Patrick Henry DeBonis will focus on some of the group constructions and deformation/rigidity arguments needed to prove FSS* group von Neumann algebras are prime - and have potential for wider applications.

A common challenge in persistent homology is choosing "good" representative cycles for homology classes in a way compatible with persistence. In this talk, we discuss a geometric framework for codimension-1 persistent homology that addresses this issue using Alexander duality.

For an embedded filtered simplicial complex, connected components of the complement induce cycle representatives for a homology basis. The evolution of these cycles along the filtration can be tracked via the merge tree of the complement and the elder rule. This leads to the notion of cycle progression barcodes, associating to each persistence interval a sequence of representative cycles evolving through the filtration.

Applying geometric functionals to these progressions produces generalized persistence landscapes, which extend classical persistence landscapes and allow geometric information about cycle representatives to be captured without fixing a single filtration value. This provides a way to distinguish data sets with similar persistent homology but different geometric structure.

Everything you have been taught about Turing patterns is wrong! (Well, not everything, but qualifying statements tend to weaken a punchy first sentence). Turing patterns are universally used to generate and understand patterns across a wide range of biological phenomena. They are wonderful to work with from a theoretical, simulation and application point of view. However, they have a paradoxical problem of being too easy to produce generally, whilst simultaneously being heavily dependent on the details. In this talk I demonstrate how to fix known problems such as small parameter regions and sensitivity, but then highlight a new set of issues that arise from usually overlooked issues, such as boundary conditions, initial conditions, and domain shape. Although we’ve been exploring Turing’s theory for longer than I’ve been alive, there’s still life in the old (spotty) dog yet.

Dr Anna Lisa Vari will talk about: 'The orbital structure of the Hill's problem'

Hill’s problem is a limiting case of the circular restricted gravitational three-body problem in which the mass ratio between the two massive bodies tends to zero, leaving a small region surrounding the secondary in which it remains gravitationally dominant. Originally formulated in terms of point masses, Hill’s problem may be modified to include a secondary of finite extent, thus providing a more realistic description of the dynamics internal to a stellar cluster orbiting within a host galaxy. By considering stellar energies above the cluster escape energy, we may investigate the dynamics that underpin the process of stellar escape from star clusters -- a topical issue in contemporary astrophysics. Specifically, we construct a self-consistent formulation of Hill’s problem using a tidally perturbed cluster model for the secondary body. The behaviour of energetically unbound stellar orbits within such a self-consistent problem, as characterised using Poincaré surfaces of section, is then numerically explored via a structure-preserving integrator, revealing a previously unknown bifurcation in the orbital structure.

Speaker Francesco Hrobat will talk about; 'Lanczos with compression for symmetric matrix Lyapunov equations'

Large-scale symmetric matrix Lyapunov equations arise in control theory, model order reduction, and the discretization of PDEs. State-of-the-art algorithms, such as standard and rational Krylov methods, aim to approximate the solution with a low-rank matrix. However, the standard polynomial Krylov method (also referred to as the Lanczos method) often converges slowly and faces a memory bottleneck as the dimension of the Lanczos basis grows. Conversely, rational Krylov alternatives, while effective for low-rank approximations, require the solution of expensive shifted linear systems involving a large coefficient matrix.

In this talk, I will present a low-memory variant of the Lanczos algorithm for solving symmetric Lyapunov equations. Our approach leverages a polynomial Krylov subspace while employing rational subspaces associated with small matrices to compress the Lanczos basis. This method accesses the large coefficient matrix exclusively through matrix-vector products and maintains fixed storage requirements. The resulting low-rank solution has a rank that is independent of the dimension of the underlying polynomial Krylov subspace.

Rare and extreme events are notoriously hard to handle in any complex stochastic system: They are simultaneously too rare to be reliably observable in experiments or numerics, but at the same time often too impactful to be ignored. Large deviation theory provides a classical way of dealing with events of extremely small probability, but generally only yields the exponential tail scaling of rare event probabilities. In this talk, I will discuss theory, and algorithms based upon it, that improve on this limitation, yielding sharp quantitative estimates of rare event probabilities from a single computation and without fitting parameters. Notably, these estimates require the computation of determinants of differential operators, which in relevant cases are not traceclass and require appropriate renormalization. We demonstrate that the Carleman--Fredholm operator determinant is the correct choice. Throughout, I will demonstrate the applicability of these methods to high-dimensional real-world systems, for example coming from atmosphere and ocean dynamics.