Past

Hoheisel's theorem states that there is some $\delta> 0$ and some $x_0>0$ such that for all $x > x_0$ the interval $[x,x+x^{1-\delta}]$ contains prime numbers. Classically this is proved using the Riemann zeta function and results about its zeros such as the zero-free region and zero density estimates. In this talk I will describe a new elementary proof of Hoheisel's theorem. This is joint work with Kaisa Matomäki (Turku) and Joni Teräväinen (Cambridge). Instead of the zeta function, our approach is based on sieve methods and ideas coming from additive combinatorics, in particular, the transference principle. The method also gives an L-function free proof of Linnik's theorem on the least prime in arithmetic progressions.

TBC

I will discuss  the well-posedness of a class of stochastic second-order in time-damped evolution equations in Hilbert spaces, subject to the constraint that the solution lies on  the unit sphere. A specific example is provided by  the stochastic damped wave equation in a bounded domain of a $d$-dimensional Euclidean space, endowed with the Dirichlet boundary conditions, with the added constraint that the $L^2$-norm of the solution is equal to one. We introduce a small mass $\mu>0$ in front of the second-order derivative in time and examine the validity of the Smoluchowski-Kramers diffusion approximation. We demonstrate that, in the small mass limit, the solution converges to the solution of a stochastic parabolic equation subject to the same constraint. We further show that an extra noise-induced drift emerges, which  in fact does not account for the Stratonovich-to-It\^{o} correction term. This talk is based on joint research with S. Cerrai (Maryland), hopefully to be published in Comm Maths Phys.

It is a long-standing open problem to generalize sheaf-counting invariants of complex projective three-folds to symplectic manifolds of real dimension six. One approach to this problem involves counting  J-holomorphic curves  C, for a generic almost complex structure J, with weights depending on J. Various existing symplectic invariants (Gromov-Witten, Gopakumar-Vafa, Bai-Swaminathan) can be expressed as such weighted counts. In this talk, based on joint work with Thomas Walpuski, I will discuss a new construction of weights associated with curves and a closely related problem about the structure of the space of Cauchy-Riemann operators on  C.

The time evolution of quantum matter systems toward their thermal equilibria, characterized by their entanglement entropy (EE), is a question that permeates many areas of modern physics. The dynamic of EE in generic chaotic many-body systems has an effective description in terms of a minimal membrane described by its membrane tension function. For strongly coupled systems with a gravity dual, the membrane tension can be obtained by projecting the bulk Hubeny-Rangamani-Ryu-Takayanagi (HRT) surfaces to the boundary along constant infalling time. In this talk, I will introduce the membrane theory of entanglement dynamics, its generalization to 2d CFT, as well as several applications. Based on arXiv: 1803.10244 and arXiv: 2411.16542.

In this interactive session, Jenny Roberts from the Institute of Mathematics and its Applications will offer guidance on what employers are looking for in mathematical graduates, and how best to sell yourself for those jobs!

There is a well-known relationship between finite W-algebras and Yangians. The work of Rogoucy and Sorba on the "rectangular case" in type A eventually led Brundan and Kleshchev to introduce shifted Yangians, which surject onto the finite W-algebras for general linear Lie algebras. Thus, these W-algebras can be realised as truncated shifted Yangians. In parallel, the work of Ragoucy and then Brown showed that truncated twisted Yangians are isomorphic to the finite W-algebra associated to a rectangular nilpotent element in a Lie algebra of type B, C or D. For many years there has been a hope that this relationship can be extended to other nilpotent elements.

I will report on a joint work with Lewis Topley in which we introduced the shifted twisted Yangians, following the work of Lu-Wang-Zhang, and described Poisson isomorphisms between their truncated semiclassical degenerations and the functions Slodowy slices associated with even nilpotent elements in classical simple Lie algebras( which can be viewed as semiclassical W-algebras). I will also mention a work in progress with Lu-Peng-Topley-Wang which deals with the quantum analogue of our theorem.

I will also recall what Poisson algebras and (filtered) quantizations are and give a brief intro to Slodowy slices, finite W-algebras and Yangians so that the talk should be quite accessible.

Tumour microenvironment is characterised by heterogeneity at various scales: from various cell populations (immune cells, cancerous cells, ...) and various molecules that populate the microenvironment (cytokines, chemokines, extracellular vesicles, …); to phenotype heterogeneity inside the same cell population (e.g., immune cells with different phenotypes and different functions); as well as temporal heterogeneity in cells’ phenotypes (as cancer evolves through time) and spatial heterogeneity.
In this talk we overview some mathematical models and computational approaches developed to investigate different single-scale and multi-scale aspects related to heterogeneous immune responses during cancer evolution. Throughout the talk we emphasise the qualitative vs. quantitative results, and data availability across different scales

The open core of a structure is the reduct generated by the open definable sets. Tame topological structures (e.g. o-minimal) are often inter-definable with their open core. Structures such as M = (ℝ,<, +, ℚ) are wild in the sense that they define a dense co-dense set. Still, M is NIP and its open core is o-minimal. In this talk, we push forward the thesis that the open core of an NTP2 (a generalization of NIP) topological structure is tame. Our main result is that, under suitable conditions, the open core has quantifier elimination (every definable set is constructible), and its definable functions are generically continuous.

We introduce a novel approach to global optimization  via continuous-time dynamic programming and Hamilton-Jacobi-Bellman (HJB) PDEs. For non-convex, non-smooth objective functions,  we reformulate global optimization as an infinite horizon, optimal asymptotic stabilization control problem. The solution to the associated HJB PDE provides a value function which corresponds to a (quasi)convexification of the original objective.  Using the gradient of the value function, we obtain a  feedback law driving any initial guess towards the global optimizer without requiring derivatives of the original objective. We then demonstrate that this HJB control law can be integrated into other global optimization frameworks to improve its performance and robustness. 

In this talk, I will discuss a conjecture of Penrose, which asserts a lower bound on the mass of a spacetime in terms of the area of a suitable horizon. Whilst Penrose presented a physical motivation for this inequality in the 1970s, the only proofs heavily rely upon PDE arguments, and in particular the use of geometric flows. I hope to show in this talk, through this concrete example (and without unpleasant technical details!), how ideas from geometric PDE theory can be helpful in obtaining results in physics.
 

I will talk about the connections between the Siu inequality and existence of the model companion for GVFs. The talk will be partially based on a joint work with Antoine Sedillot.

The hyperbolic plane and its higher-dimensional analogues are well-known
objects. They belong to a larger class of spaces, called rank-one
symmetric spaces, which include not only the hyperbolic spaces but also
their complex and quaternionic counterparts, and the octonionic
hyperbolic plane. By a result of Pansu, two of these families exhibit
strong rigidity properties with respect to their self-quasiisometries:
any self-quasiisometry of a quaternionic hyperbolic space or the
octonionic hyperbolic plane is at uniformly bounded distance from an
isometry. The goal of this talk is to give an overview of the rank-one
symmetric spaces and the tools used to prove Pansu's rigidity theorem,
such as the subRiemannian structure of their visual boundaries and the
analysis of quasiconformal maps.

This is  a notion we defined with Johan de Jong. If a finitely presented group  is the topological fundamental group of a smooth quasi-projective complex variety, then we prove that it is weakly integral. To this aim we use the Langlands program (both arithmetic to produce companions and geometric to use de Jong’s conjecture). On the other hand there are finitely presented groups which are not weakly integral (Breuillard). So this notion is an obstruction.
 

Self-similar groups are groups of automorphisms of infinite rooted trees obeying a simple but powerful rule. Under this rule, groups with exotic properties can be generated from very basic starting data, most famously the Grigorchuk group which was the first example of a group with intermediate growth.

Nekrashevych introduced a groupoid and a C*-algebra for a self-similar group action on a tree as models for some underlying noncommutative space for the system. Our goal is to compute the K-theory of the C*-algebra and the homology of the groupoid. Our main theorem provides long exact sequences which reduce the problems to group theory. I will demonstrate how to apply this theorem to fully compute homology and K-theory through the example of the Grigorchuk group.

This is joint work with Benjamin Steinberg.

Let G be a free group of rank N, let f be an automorphism of G and let Fix(f) be the corresponding subgroup of fixed points. Bestvina and Handel showed that the rank of Fix(f) is at most N, for which they developed the theory of train track maps on free groups. Different arguments were provided later on by Sela, Paulin and Gaboriau-Levitt-Lustig. In this talk, we present a new proof which involves the Linnell division ring of G. We also discuss how our approach relates to previous ones and how it gives new insight into variations of the problem.

While the brain has long been conceptualized as a network of neurons connected by synapses, attempts to describe the connectome using established models in network science have yielded conflicting outcomes, leaving the architecture of neural networks unresolved. Here, we analyze eight experimentally mapped connectomes, finding that the degree and the strength distribution of the underlying networks cannot be described by random nor scale-free models. Rather, the node degrees and strengths are well approximated by lognormal distributions, whose emergence lacks a mechanistic model in the context of networks. Acknowledging the fact that the brain is a physical network, whose architecture is driven by the spatially extended nature of its neurons, we analytically derive the multiplicative process responsible for the lognormal neuron length distribution, arriving to a series of empirically falsifiable predictions and testable relationships that govern the degree and the strength of individual neurons. The lognormal network characterizing the connectome represents a novel architecture for network science, that bridges critical gaps between neural structure and function, with unique implications for brain dynamics, robustness, and synchronization.

Upper bounds on the number of incidences between points and lines, tubes, and other geometric objects, have many applications in combinatorics and analysis. On the other hand, much less is known about lower bounds. We prove a general lower bound for the number of incidences between points and tubes in the plane under a natural spacing condition. In particular, if you take $n$ points in the unit square and draw a line through each point, then there is a non-trivial point-line pair with distance at most $n^{-2/3+o(1)}$. This quickly implies that any $n$ points in the unit square define a triangle of area at most $n^{-7/6+o(1)}$, giving a new upper bound for the Heilbronn's triangle problem.

Joint work with Alex Cohen and Cosmin Pohoata.

Let X be a n by n unitary matrix, drawn at random according to the Haar measure on U_n, and let m be a natural number. What can be said about the distribution of X^m and its eigenvalues? 

The density of the distribution \tau_m of X^m can be written as a linear combination of irreducible characters of U_n, where the coefficients are the Fourier coefficients of \tau_m. In their seminal work, Diaconis and Shahshahani have shown that for any fixed m, the sequence (tr(X),tr(X^2),...,tr(X^m)) converges, as n goes to infinity, to m independent complex normal random variables (suitably normalized). This can be seen as a statement about the low-dimensional Fourier coefficients of \tau_m. 

In this talk, I will focus on high-dimensional spectral information about \tau_m. For example: 

(a) Can one give sharp estimates on the rate of decay of its Fourier coefficients?

(b) For which values of p, is the density of \tau_m  L^p-integrable? 

Using works of Rains about the distribution of X^m, we will see how Item (a) is equivalent to a branching problem in the representation theory of certain compact homogeneous spaces, and how (b) is equivalent to a geometric problem about the singularities of certain varieties called (Weyl) hyperplane arrangements.

Based on joint works with Julia Gordon and Yotam Hendel and with Nir Avni and Michael Larsen.

A question we get asked all the time! We'll also be discussing the numerous ways our identities as Mathematicians are shaped by being a minority. Free lunch provided.

Gauging is a systematic way to construct a model with non-invertible symmetry from a model with ordinary group-like symmetry. In 2+1d dimensions or higher, one can generalize the standard gauging procedure by stacking a symmetry-enriched topological order before gauging the symmetry. This generalized gauging procedure allows us to realize a large class of non-invertible symmetries. In this talk, I will describe the generalized gauging of finite group symmetries in 2+1d lattice models. This talk will be based on my ongoing work with L. Bhardwaj, S.-J. Huang, S. Schäfer-Nameki, and A. Tiwari.

The Camassa–Holm equation, which is nonlinear one-dimensional nonlinear PDE which is completely integrable and has  applications in several areas, has received considerable attention. We will discuss recent work regarding the Camassa—Holm equation with transport noise, more precisely, the equation $u_t+uu_x+P_x+\sigma u_x \circ dW=0$ and $P-P_{xx}=u^2+u_x^2/2$. În particular, we will show existence of a weak, global, dissipative solution of the Cauchy initial-value problem on the torus.  This is joint work with L. Galimberti (King’s College), K.H. Karlsen (Oslo), and P.H.C. Pang (NTNU/Oslo).

The class of henselian valued fields with non-discrete value group is not well-understood. In 2018, Koenigsmann conjectured that a list of seven natural axioms describes a complete axiomatisation of $\mathbb{Q}_p^{ab}$, the maximal extension of the $p$-adic numbers $\mathbb{Q}_p$ with abelian Galois group, which is an example of such a valued field. Informed by the recent work of Jahnke-Kartas on the model theory of perfectoid fields, we formulate an eighth axiom (the discriminant property) that is not a consequence of the other seven. Revisiting work by Koenigsmann (the Galois characterisation of $\mathbb{Q}_p$) and Jahnke-Kartas, we give a uniform treatment of their underlying method. In particular, we highlight how this method yields short, non-standard model-theoretic proofs of known results (e.g. finite extensions of perfectoid fields are perfectoid).

I’ll tell you about some of my favorite algebraic varieties, which are beautiful in their own right, and also have some dramatic applications to algebraic combinatorics.  These include the top-heavy conjecture (one of the results for which June Huh was awarded the Fields Medal), as well as non-negativity of Kazhdan—Lusztig polynomials of matroids.

Cost-sensitive loss functions are crucial in many real-world prediction problems, where different types of errors are penalized differently; for example, in medical diagnosis, a false negative prediction can lead to worse consequences than a false positive prediction. However, traditional learning theory has mostly focused on the symmetric zero-one loss, letting cost-sensitive losses largely unaddressed. In this work, we extend the celebrated theory of boosting to incorporate both cost-sensitive and multi-objective losses. Cost-sensitive losses assign costs to the entries of a confusion matrix, and are used to control the sum of prediction errors accounting for the cost of each error type. Multi-objective losses, on the other hand, simultaneously track multiple cost-sensitive losses, and are useful when the goal is to satisfy several criteria at once (e.g., minimizing false positives while keeping false negatives below a critical threshold). We develop a comprehensive theory of cost-sensitive and multi-objective boosting, providing a taxonomy of weak learning guarantees that distinguishes which guarantees are trivial (i.e., can always be achieved), which ones are boostable (i.e., imply strong learning), and which ones are intermediate, implying non-trivial yet not arbitrarily accurate learning. For binary classification, we establish a dichotomy: a weak learning guarantee is either trivial or boostable. In the multiclass setting, we describe a more intricate landscape of intermediate weak learning guarantees. Our characterization relies on a geometric interpretation of boosting, revealing a surprising equivalence between cost-sensitive and multi-objective losses.

It was recently argued that topological operators (at least those associated with continuous symmetries) need regularization. However, such regularization seems to be ill-defined when the underlying QFT is coupled to gravity. If both of these claims are correct, it means that charges cannot be meaningfully measured in the presence of gravity. I will review the evidence supporting these claims as discussed in [arXiv:2411.08858]. Given the audience's high level of expertise, I hope this will spark discussion about whether this is a promising approach to understanding the fate of global symmetries in quantum gravity.

Dey and Xin (J. Appl.Comput.Top. 2022) describe an algorithm to decompose finitely presented multiparameter persistence modules using a matrix reduction algorithm. Their algorithm only works for modules whose generators and relations are distinctly graded. We extend their approach to work on all finitely presented modules and introduce several improvements that lead to significant speed-ups in practice.

Our algorithm is FPT with respect to the maximal number of relations with the same degree and with further optimisation we obtain an O(n³) algorithm for interval-decomposable modules. As a by-product to the proofs of correctness we develop a theory of parameter restriction for persistence modules. Our algorithm is implemented as a software library aida which is the first to enable the decomposition of large inputs.

This is joint work with Tamal Dey and Michael Kerber.

Bernstein–Gelfand–Gelfand (BGG) resolutions and the Grothendieck–Cousin complex both play central roles in modern algebraic geometry and representation theory. The BGG approach provides elegant, combinatorial resolutions for important classes of modules especially those arising in Lie theory; while Grothendieck–Cousin complexes furnish a powerful framework for computing local cohomology via filtrations by support. In this talk, we will give an overview of these two constructions and illustrate how they arise from the same categorical consideration.

Understanding how living systems dynamically self-organise across spatial and temporal scales is a fundamental problem in biology; from the study of embryo development to regulation of cellular physiology. In this talk, I will discuss how we can use mathematical modelling to uncover the role of microscale physical interactions in cellular self-organisation. I will illustrate this by presenting two seemingly unrelated problems: environmental-driven compartmentalisation of the intracellular space; and self-organisation during collective migration of multicellular communities. Our results reveal hidden connections between these two processes hinting at the general role that chemical regulation of physical interactions plays in controlling self-organisation across scales in living matter

For some values of degrees d=(d_1,...,d_c), we construct a compactification of a Hilbert scheme of complete intersections of type d. We present both a quotient and a direct construction. Then we work towards the construction of a quasiprojective coarse moduli space of smooth complete intersections via Geometric Invariant Theory.

I will discuss several interesting examples of classes of structures for which there is a sensible first-order theory of "almost all" structures in the class, for certain notions of "almost all". These examples include the classical theory of almost all finite graphs due to Glebskij-Kogan-Liogon'kij-Talanov and Fagin (and many more examples from finite model theory), as well as more recent examples from the model theory of infinite fields: the theory of almost all algebraic extensions and the universal/existential theory of almost all completions of a global field (both joint work with Arno Fehm). Interestingly, such asymptotic theories are sometimes quite well-behaved even when the base theories are not.

This paper shows that a simple sale contract with a collection of options implements the full-information first-best allocation in a variety of continuous-time dynamic adverse selection settings with news. Our model includes as special cases most models in the literature. The implementation result holds regardless of whether news is public (i.e., contractible) or privately observed by the buyer, and it does not require deep pockets on either side of the market. It is an implication of our implementation result that, irrespective of the assumptions on the game played, no agent waits for news to trade in such models. The options here do not play a hedging role and are, thus, not priced using a no-arbitrage argument. Rather, they are priced using a game-theoretic approach.

I will explain the content of Geometric Langlands (which is a theorem over the ground fields of characteristic 0 but still a conjecture in positive characteristic) and show how it implies a description of the space of automorphic functions in terms of Galois data. The talk will mostly follow a joint paper with Arinkin, Kazhdan, Raskin, Rozenblyum and Varshavsky from 2022.

Deflation is a technique to remove a solution to a problem so that other solutions to this problem can subsequently be found. The most prominent instance is deflation we see in eigenvalue solvers, but recent interest has been in deflation of rootfinding problems from nonlinear PDEs with many isolated solutions (spearheaded by Farrell and collaborators). 

In this talk I’ll show you recent results on deflation techniques for optimisation algorithms with many local minima, focusing on the Gauss—Newton algorithm for nonlinear least squares problems.  I will demonstrate advantages of these techniques instead of the more obvious approach of applying deflated Newton’s method to the first order optimality conditions and present some proofs that these algorithms will avoid the deflated solutions. Along the way we will see an interesting generalisation of Woodbury’s formula to least squares problems, something that should be more well known in Numerical Linear Algebra (joint work with Güttel, Nakatsukasa and Bloor Riley).

Main preprint: https://arxiv.org/abs/2409.14438. 

WoodburyLS preprint: https://arxiv.org/abs/2406.15120

A number of algorithms are now available---including Halko-Martinsson-Tropp, interpolative decomposition, CUR, generalized Nystrom, and QR with column pivoting---for computing a low-rank approximation of matrices. Some methods come with extremely strong guarantees, while others may fail with nonnegligible probability. We present methods for efficiently estimating the error of the approximation for a specific instantiation of the methods. Such certificate allows us to execute "responsibly reckless" algorithms, wherein one tries a fast, but potentially unstable, algorithm, to obtain a potential solution; the quality of the solution is then assessed in a reliable fashion, and remedied if necessary. This is joint work with Gunnar Martinsson. 

Time permitting, I will ramble about other topics in Randomised NLA. 

We consider two problems in fluid dynamics: the collective locomotion of flying animals and the interaction of vortex rings with fluid interfaces. First, we present a model of formation flight, viewing the group as a material whose properties arise from the flow-mediated interactions among its members. This aerodynamic model explains how flapping flyers produce vortex wakes and how they are influenced by the wakes of others. Long in-line arrays show that the group behaves as a soft, excitable "crystal" with regularly ordered member "atoms" whose positioning is susceptible to deformations and dynamical instabilities. Second, we delve into the phenomenon of vortex ring reflections at water-air interfaces. Experimental observations reveal reflections analogous to total internal reflection of a light beam. We present a vortex-pair--vortex-sheet model to simulate this phenomenon, offering insights into the fundamental interactions of vortex rings with free surfaces.

Originally posed in the 1950s, the Hadwiger-Nelson problem interrogates the ‘chromatic number of the plane’ via an infinite unit-distance graph. This question remains open today, known only to be 5,6, or 7. We may ask the same question of the hyperbolic plane; there the lack of homogeneous dilations leads to unique behaviour for each length scale d. This variance leads to other questions: is the d-chromatic number finite for all d>0? How does the d-chromatic number behave as d increases/decreases? In this talk, I will provide a summary of existing methods and results, before discussing improved bounds through the consideration of semi-regular tilings of the hyperbolic plane.