Past

We investigate a stochastic differential game in which a major player has a private information (the knowledge of a random variable), which she discloses through her control to a population of small players playing in a Nash Mean Field Game equilibrium. The major player’s cost depends on the distribution of the population, while the cost of the population depends on the random variable known by the major player. We show that the game has a relaxed solution and that the optimal control of the major player is approximatively optimal in games with a large but finite number of small players. Joint work with Pierre Cardaliaguet and Catherine Rainer.

The study of polynomials whose coefficients lie in a given set $S$ (the most notable examples being $S=\{0,1\}$ or $\{-1,1\}$) has a long history leading to many interesting results and open problems. We begin with a brief general overview of this topic and then focus on the following old problem of Littlewood. Let $A$ be a set of positive integers, let $f_A(x)=\sum_{n\in A}\cos(nx)$ and define $Z(f_A)$ to be the number of zeros of $f_A$ in $[0,2\pi]$. The problem is to estimate the quantity $Z(N)$ which is defined to be the minimum of $Z(f_A)$ over all sets $A$ of size $N$. We discuss recent progress showing that $Z(N)\geqslant (\log \log N)^{1-o(1)}$ which provides an exponential improvement over the previous lower bound. 

A closely related question due to Borwein, Erd\'elyi and Littmann asks about the minimum number of zeros of a cosine polynomial with $\pm 1$-coefficients. Until recently it was unknown whether this even tends to infinity with the degree $N$. We also discuss work confirming this conjecture.

In this talk we will provide an overview of a number of mathematical models of cancer growth and development - gene regulatory networks, the immune response to cancer, avascular solid tumour growth, tumour-induced angiogenesis, cancer invasion and metastasis. In the talk we will also discuss (the art of) mathematical modelling itself giving illustrations and analogies from works of art. 

The reduced twisted C*-algebra A of an étale groupoid G has a canonical abelian subalgebra D: functions on G's unit space. When G has no non-trivial abelian subgroupoids (i.e., G is principal), then D is in fact maximal abelian. Remarkable work by Kumjian shows that the tuple (A,D) allows us to reconstruct the underlying groupoid G and its twist uniquely; this uses that D is not only masa but even what is called a C*-diagonal. In this talk, I show that twisted C*-algebras of non-principal groupoids can also have such C*-diagonal subalgebras, arising from non-trivial abelian subgroupoids, and I will discuss the reconstructed principal twisted groupoid of Kumjian for such pairs of algebras.

We are now able to solve many partial differential equation problems that were well beyond reach when I started in academia. Some of this success is due to computer hardware but much is due to algorithmic advances. 

I will give a personal perspective of the development of computational methodology in this area over my career thus far. 

Perturbation theory is one of the main tools in the modern physicist's toolbox to solve problems. Indeed, it can often the only approach we have to computing any quantity of interest in a physical theory. However, perturbative contributions can actually grow as we increase the order. Thus, many perturbative series in physics are asymptotic, with 0 radius of convergence. In this talk, I will describe resurgence, which gives us a way of treat such series, by adding non-perturbative effects in a systematic manner.

Junior Strings is a seminar series where DPhil students present topics of common interest that do not necessarily overlap with their own research area. This is primarily aimed at PhD students and post-docs but everyone is welcome.

The widespread need to solve large-scale linear systems has sparked a growing interest in randomized techniques. One such class of techniques is known as iterative random sketching methods (e.g., Randomized Block Kaczmarz and Randomized Block Coordinate Descent). These methods "sketch" the linear system to generate iterative, easy-to-compute updates to a solution. By working with sketches, these methods can often enable more efficient memory operations, potentially leading to faster performance for large-scale problems. Unfortunately, tracking the progress of these methods still requires computing the full residual of the linear system, an operation that undermines the benefits of the solvers. In practice, this cost is mitigated by occasionally computing the full residual, typically after an epoch. However, this approach sacrifices real-time progress tracking, resulting in wasted computations. In this talk, we use statistical techniques to develop a progress estimation procedure that provides inexpensive, accurate real-time progress estimates at the cost of a small amount of uncertainty that we effectively control.

It is well known that adding even small amounts of  long chain polymers (e.g. few parts per million) to Newtonian solvents can drastically change the flow behaviour by introducing elasticity. In particular,  two decades ago, experiments in curved geometries  demonstrated  that polymer flows can be  chaotic even at vanishingly small Reynolds numbers. The situation in `straight’ flows  such as pressure-driven flow down a channel is less clear  and hence an area of current focus. I will discuss recent progress.

Jochen Koenigsmann’s Habilitation introduced a classification of fields elementarily characterised by their absolute Galois groups, including two conjecturally empty families. The emptiness of one of these families would follow from a Galois cohomological conjecture concerning radically closed fields formulated by Koenigsmann. A promising approach to resolving this conjecture involves the use of local-global principles in Galois cohomology. This talk examines the conceptual foundations of this method, highlights its relevance to Koenigsmann’s classification, and evaluates existing local-global principles with regard to their applicability to this conjecture.

In this talk, I will introduce fusion categories as categorical versions of finite rings. We will discuss some examples which may already be familiar, like the category of representations of a finite group and the category of vector spaces graded over a finite group. Then, we will define Tambara-Yamagami categories, which are a certain type of fusion categories which have one simple object which is non-invertible. I will provide the classification results of Tambara and Yamagami on these categories and give some small examples. Time permitting, I will discuss current work in progress on how to generalize Tambara-Yamagami fusion categories to locally compact groups. 

This talk will not assume familiarity with category theory further than the definition of a category and a functor.

According to a conjecture by Landau-Pekar (1948) and by Spohn (1986), the effective mass of the Fröhlich Polaron should diverge in the strong coupling limit like a quartic power of the coupling constant. In a recent joint with R. Bazaes, M. Sellke and S.R.S. Varadhan, we prove this conjecture.

A trace on a group is a positive-definite conjugation-invariant function on it. These traces correspond to tracial states on the group's maximal  C*-algebra. In the past couple of decades, the study of traces has led to exciting connections to the rigidity, stability, and dynamics of groups. In this talk, I will explain these connections and focus on the topological structure of the space of traces of some groups. We will see the different behaviours of these spaces for free groups vs. higher-rank lattices, and how our strategy for the free group can be used to answer a question of Musat and Rørdam regarding free products of matrix algebras. This is based on joint works with Arie Levit, Joav Orovitz, and Itamar Vigdorovich.

Selberg’s CLT informs us that the logarithm of the Riemann zeta function evaluated on the critical line behaves as a complex Gaussian. It is natural, therefore, to study how far this Gaussianity persists. This talk will present conditional and unconditional results on atypically large values, and concerns work joint with Louis-Pierre Arguin and Asher Roberts.

Topically, my goal is to provide a fun and instructive introduction to graph cumulants: a hierarchical set of subgraph statistics that extend the classical cumulants (mean, (co)variance, skew, kurtosis, etc) to relational data.  

Intuitively, graph cumulants quantify the propensity (if positive) or aversion (if negative) for the appearance of any particular subgraph in a larger network.  

Concretely, they are derived from the “bare” subgraph densities via a Möbius inversion over the poset of edge partitions.  

Practically, they offer a systematic way to measure similarity between graph distributions, with a notable increase in statistical power compared to subgraph densities.  

Algebraically, they share the defining properties of cumulants, providing clever shortcuts for certain computations.  

Generally, their definition extends naturally to networks with additional features, such as edge weights, directed edges, and node attributes.  

Finally, I will discuss how this entire procedure of “cumulantification” suggests a promising framework for a motif-centric statistical analysis of general structured data, including temporal and higher-order networks, leaving ample room for exploration. 

In 1975, Bollobás, Erdős, and Szemerédi asked the following Zarankiewicz-type problem. What is the smallest $\tau$ such that an $n \times n \times n$ tripartite graph with minimum degree $n + \tau$ must contain $K_{t, t, t}$? They further conjectured that $\tau = O(n^{1/2})$ when $t = 2$.

I will discuss our proof that $\tau = O(n^{1 - 1/t})$ (confirming their conjecture) and an infinite family of extremal examples. The bound $O(n^{1 - 1/t})$ is best possible whenever the Kővári-Sós-Turán bound $\operatorname{ex}(n, K_{t, t}) = O(n^{2 - 1/t})$ is (which is widely-conjectured to be the case).

This is joint work with Francesco Di Braccio (LSE).

Consider a connected graph and choose a subset of its vertices. From this simple setup, Iyama and Wemyss define a collection of real hyperplanes known as an intersection arrangement, going on to classify all tilings of the affine plane that arise in this way. These "local" generalisations of Coxeter combinatorics also admit a nice wall-crossing structure via Dynkin involutions and longest Weyl elements. In this talk I give an analogous classification in the hyperbolic setting using the data of an "overextended" ADE diagram with three distinguished vertices. I then discuss ongoing work applying intersection arrangements to parametrise notions of stability conditions for preprojective algebras.

Realizing chiral global symmetries on a finite lattice is a long-standing challenge in lattice gauge theory, with potential implications for non-perturbative regularization of the Standard Model. One of the simplest examples of such a symmetry is the axial U(1) symmetry of the 1+1d massless Dirac fermion field theory: it acts by equal and opposite phase rotations on the left- and right-moving Weyl components of the Dirac field. This field theory also has a vector U(1) symmetry which acts identically on left- and right-movers. The two U(1) symmetries exhibit a mixed anomaly, known as the chiral anomaly. In this talk, we will discuss how both symmetries are realized as ordinary U(1) symmetries of an "ultra-local" lattice Hamiltonian, on a finite-dimensional Hilbert space. Intriguingly, the anomaly of the Abelian U(1) symmetries in the infrared (IR) field theory is matched on the lattice by a non-Abelian Lie algebra. The lattice symmetry forces the low-energy phase to be gapless, closely paralleling the effects of the anomaly in the field theory.

I will introduce the class of causally-null-compactifiable spacetimes that can be canonically converted into compact timed-metric spaces using the cosmological time function of Andersson-Galloway-Howard and the null distance of Sormani-Vega. This class of space-times includes future developments of compact initial data sets and regions exhausting asymptotically flat space-times. I will discuss various intrinsic notions of distance between such space-times and show that some of them are definite in the sense that they are equal to zero if and only if there is a time-oriented Lorentzian isometry between the space-times. These definite distances allow us to define notions of convergence of space-times to limit space-times that are not necessarily smooth. This is joint work with Christina Sormani.

TBC

Global well-posedness of 3D Navier-Stokes equations (NSEs) is one of the biggest open problems in modern mathematics. A long-standing conjecture in stochastic fluid dynamics suggests that physically motivated noise can prevent (potential) blow-up of solutions of the 3D NSEs. This phenomenon is often referred to as `regularization by noise'. In this talk, I will review recent developments on the topic and discuss the solution to this problem in the case of the 3D NSEs with small hyperviscosity, for which the global well-posedness in the deterministic setting remains as open as for the 3D NSEs. An extension of our techniques to the case without hyperviscosity poses new challenges at the intersection of harmonic and stochastic analysis, which, if time permits, will be discussed at the end of the talk.

This talk reports on two projects. The first work (in progress), joint  with Amanda Hirschi, constructs (genus 0) open Gromov-Witten invariants for any Lagrangian submanifold using a global Kuranishi chart construction. As an application we show open Gromov-Witten invariants are invariant under Lagrangian cobordisms. I will then describe how open Gromov-Witten invariants fit into mirror symmetry, which brings me to the second project: obtaining open Gromov-Witten invariants from the Fukaya category.

We begin with a short overview of Random Matrix Theory (RMT), focusing on the Marchenko-Pastur (MP) spectral approach. 

Next, we present recent analytical and numerical results on accelerating the training of Deep Neural Networks (DNNs) via MP-based pruning ([1]). Furthermore, we show that combining this pruning with L2 regularization allows one to drastically decrease randomness in the weight layers and, hence, simplify the loss landscape. Moreover, we show that the DNN’s weights become deterministic at any local minima of the loss function. 
 

Finally, we discuss our most recent results (in progress) on the generalization of the MP law to the input-output Jacobian matrix of the DNN. Here, our focus is on the existence of fixed points. The numerical examples are done for several types of DNNs: fully connected, CNNs and ViTs. These works are done jointly with PSU PhD students M. Kiyashko, Y. Shmalo, L. Zelong and with E. Afanasiev and V. Slavin (Kharkiv, Ukraine). 

[1] Berlyand, Leonid, et al. "Enhancing accuracy in deep learning using random matrix theory." Journal of Machine Learning. (2024).

Measurement-Based Quantum Computation (MBQC) is a model of quantum computation driven by measurements instead of unitary gates.   In 2D it is capable of supporting universal quantum computations.   Interestingly, while all measurements are local, the computational output involves non local observables.   We will use the simpler case of 1D MBQC to illustrate how these features can be captured by ideas from gauge theory and extended TQFT. We will also explain  MBQC from the perspective of the extended Hilbert space construction in gauge theories, in which the entanglement edge modes play the role of the logical qubit.

How can it be that so many clever, competent and capable people can feel that they are just one step away from being exposed as a complete fraud? Despite evidence that they are performing well they can still have that lurking fear that at any moment someone is going to tap them on the shoulder and say "We need to have a chat". If you've ever felt like this, or you feel like this right now, then this Friday@2 session might be of interest to you. We'll explore what "Imposter Feelings" are, why we get them and steps you can start to take to help yourself and others. This event is likely to be of interest to undergraduates and MSc students at all stages. 

In ’95 Lusztig gave a local Langlands correspondence for unramified representations of inner to split adjoint groups combining many deep results from type theory and geometric representation theory. In this talk, I will present a gentle reformulation of his construction revealing some interesting new structures, and with a view toward proving functoriality results in this framework. 

This seminar is organised jointly with the Junior Algebra and Representation Theory Seminar - all are very welcome!

In ’95 Lusztig gave a local Langlands correspondence for unramified representations of inner to split adjoint groups combining many deep results from type theory and geometric representation theory. In this talk I will present a gentle reformulation of his construction revealing some interesting new structures, and with a view toward proving functoriality results in this framework. 

This is a report on the ongoing joint project with Giovanni Felder and David Kazhdan. I'll describe a conjectural way to set up the integration of the superstring measure on the moduli space of supercurves, including a brief review of the necessary supergeometry. The main theorem is that this setup works for genus 2 with no punctures.

Underlying many biological models are chemical reaction networks (CRNs), and identifying allowed and forbidden dynamics in reaction networks may 
give insight into biological mechanisms. Algebraic approaches have been important in several recent developments. For example, computational 
algebra has helped us characterise all small mass action CRNs admitting certain bifurcations; allowed us to find interesting and surprising 
examples and counterexamples; and suggested a number of conjectures.   Progress generally involves an interaction between analysis and 
computation: on the one hand, theorems which recast apparently difficult questions about dynamics as (relatively tractable) algebraic problems; 
and on the other, computations which provide insight into deeper theoretical questions. I'll present some results, examples, and open 
questions, focussing on two domains of CRN theory: the study of local bifurcations, and the study of multistationarity.

A number of results on classical problems in analytic number theory rely on bounds for multilinear forms of Kloosterman sums, which in turn use deep inputs from the spectral theory of automorphic forms. We’ll discuss our recent work available at arxiv.org/abs/2404.04239, which uses this interplay between counting problems, exponential sums, and automorphic forms to improve results on the greatest prime factor of $n^2+1$, and on the exponents of distribution of primes and smooth numbers in arithmetic progressions.
The key ingredient in this work are certain “large sieve inequalities” for exceptional Maass forms, which improve classical results of Deshouillers-Iwaniec in special settings. These act as on-average substitutes for Selberg’s eigenvalue conjecture, narrowing (and sometimes completely closing) the gap between previous conditional and unconditional results.

The (Local) Lifting Property ((L)LP) is introduced by Kirchberg and deals with lifting completely positive maps. We will discuss various examples, characterizations, and closure properties of the (L)LP and, if time permits, connections with some other lifting properties of C*-algebras.  Joint work with Dominic Enders.

Large Language Models (LLMs) have demonstrated impressive achievements. However, recent research has shown that their deeper layers often contribute minimally, with effectiveness diminishing as layer depth increases. This pattern presents significant opportunities for model compression. 

In the first part of this seminar, we will explore how this phenomenon can be harnessed to improve the efficiency of LLM compression and parameter-efficient fine-tuning. Despite these opportunities, the underutilization of deeper layers leads to inefficiencies, wasting resources that could be better used to enhance model performance. 

The second part of the talk will address the root cause of this ineffectiveness in deeper layers and propose a solution. We identify the issue as stemming from the prevalent use of Pre-Layer Normalization (Pre-LN) and introduce Mix-Layer Normalization (Mix-LN) with combined Pre-LN and Post-LN as a new approach to mitigate this training deficiency.

The Brunn-Minkowski inequality gives a lower bound on the volume of the set of midpoints of line segments joining two sets. On a Riemannian manifold, line segments are replaced by geodesic segments, and the Brunn-Minkowski inequality characterizes manifolds with nonnegative Ricci curvature. I will present a generalization of the Riemannian Brunn-Minkowski inequality where geodesics are replaced by magnetic geodesics, which are minimizers of a functional given by length minus the integral of a fixed one-form on the manifold. The Brunn-Minkowski inequality is then equivalent to nonnegativity of a suitably defined magnetic Ricci curvature. More generally, I will present a magnetic version of the Borell-Brascamp-Lieb inequality of Cordero-Erausquin, McCann and Schmuckenschläger. The proof uses the needle decomposition technique.

Multicomponent flows, i.e. mixtures, can be modeled effectively using the Onsager-Stefan-Maxwell (OSM) equations. The OSM equations can account for a wide variety of phenomena such as diffusive, convective, non-ideal mixing, thermal, pressure and electrochemical effects for steady and transient multicomponent flows. I will first introduce the general OSM framework and a finite element discretisation for multicomponent diffusion of ideal gasses. Then I will show two ways of preconditioning the multicomponent diffusion problem for various boundary conditions. Time permitting, I will also discuss how this can be extended to the non-ideal, thermal, and nonisobaric settings.

How should we interpret past mathematicians who may use the same vocabulary as us but with different meanings, or whose philosophical outlooks differ from ours? Errors aside, it is often assumed that past mathematicians largely made true claims—but what exactly justifies that assumption?

In this talk, we will explore these questions through general philosophical considerations and three case studies: 19th-century analysis, 18th-century geometry, and 19th-century matricial algebra.  In each case, we encounter a significant challenge to supposing that the mathematicians in question made true claims. We will show how these challenges can be addressed and overcome.

In 1911, Otto Toeplitz posed the intriguing "Square Peg Problem," asking whether every Jordan curve admits an inscribed square. Despite over a century of study, the problem remains unsolved in its full generality. However, significant progress has been made over the years. In this talk, we explore recent advancements by Andrew Lobb and Joshua Greene, who approach the problem through the lens of Lagrangian Floer homology. Specifically, we outline a proof of their result: every smooth Jordan curve inscribes every rectangle up to similarity.

I will present TeXmacs (www.texmacs.org), a document preparation system with structured editing and high quality typography, designed to create technical documents. 

For more details see https://mgubi.github.io/docs/programming.html

Motivated by a recent experiment on a superconducting quantum
information processor, I will discuss the Floquet quantum Ising model in
the presence of integrability- and symmetry-breaking random fields. The
talk will focus on the relation between boundary spin correlations,
spectral pairings, and effects of the random fields. If time permits, I
will also touch upon self-similarity in the dynamic phase diagram of
Fibonacci-driven quantum Ising models.
 

I will give a light introduction to the concept of a quantum expander, which is an analogue of an expander graph that arises in quantum information theory.  Most examples of quantum expanders that appear in the quantum information literature are obtained by random matrix techniques.  I will explain another, more algebraic approach to constructing quantum expanders, which is based on using actions and representations of discrete quantum groups with Kazhdan's property (T).  This is joint work with Eric Culf (U Waterloo) and Matthijs Vernooij (TU Delft).   

In a recent breakthrough Campos, Griffiths, Morris and Sahasrabudhe obtained the first exponential improvement of the upper bound on the classical Ramsey numbers since 1935. I will outline a reinterpretation of their proof, replacing the underlying book algorithm with a simple inductive statement. In particular, I will present a complete proof of an improved upper bound on the off-diagonal Ramsey numbers and describe the main steps involved in improving their upper bound for the diagonal Ramsey numbers to $R(k,k)\le(3.8)^k$ for sufficiently large $k$.

Based on joint work with Parth Gupta, Ndiame Ndiaye, and Louis Wei.

I will present a joint work with Thang Nguyen where we show that there exists a quasi-isometric embedding of the product of n copies of the hyperbolic plane into any symmetric space of non-compact type of rank n, and there exists a bi-Lipschitz embedding of the product of n copies of the 3-regular tree into any thick Euclidean building of rank n. This extends a previous result of Fisher--Whyte. The proof is purely geometrical, and the result also applies to the non Bruhat--Tits buildings. I will start by describing the objects and the embeddings, and then give a detailed sketch of the proof in rank 2.

Networks provide a powerful language to model and analyse interconnected systems. Their building blocks are  edges, which can  then be combined to form walks and paths, and thus define indirect relations between distant nodes and model flows across the system. In a traditional setting, network models are first-order, in the sense that flow across nodes is made of independent sequences of transitions. However, real-world systems often exhibit higher-order dependencies, requiring more sophisticated models. Here, we propose a variable-order network model that captures memory effects by interpolating between first- and second-order representations. Our method identifies latent modes that explain second-order behaviors, avoiding overfitting through a Bayesian prior. We introduce an interpretable measure to balance model size and description quality, allowing for efficient, scalable processing of large sequence data. We demonstrate that our model captures key memory effects with minimal state nodes, providing new insights beyond traditional first-order models and avoiding the computational costs of existing higher-order models.

Let $(V(u))$ be a branching random walk and $(\eta(u))$ be i.i.d marks on the vertices. To each path $\xi$ of the tree, we associate the discounted sum $D(\xi)$ which is the sum of the $\exp(V(u))\eta_u$ along the path. We study conditions under which $\sup_\xi D(\xi)$ is finite, answering an open question of Aldous and Bandyopadhyay. We will see that this problem is related to the study of the local time process of the branching random walk along a path. It is a joint work with Yueyun Hu and Zhan Shi.

Suppose a finite group satisfies the following property: If you take two random elements, then with probability bigger than 5/8 they commute. Then this group is commutative. 

Starting from this well-known result, it is natural to ask: Do similar results hold for other laws (p-groups, nilpotent groups...)? Are there analogous results for infinite groups? Are there phenomena specific to the infinite setup? 

We will survey known and new results in this area. New results are joint with Gideon Amir, Maria Gerasimova and Gady Kozma.