Past

We will be joined by Philip Maini, Professor of Mathematical Biology and Ethnic Minorities Fellow at St John's College, to discuss his mathematical journey and experiences.

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades (subtrees) are recursively split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities $\propto 1/(i(m-i))$. This model turns out to have interesting properties. There is a canonical embedding into a continuous-time model ($\operatorname{CTCS}(n)$). There is an inductive construction of $\operatorname{CTCS}(n)$ as $n$ increases, analogous to the stick-breaking constructions of the uniform random tree and its limit continuum random tree. We study the heights of leaves and the limit fringe distribution relative to a random leaf. In addition to familiar probabilistic methods, there are analytic methods (developed by co-author Boris Pittel), based on explicit recurrences, which often give more precise results. So this model provides an interesting concrete setting in which to compare and contrast these methods. Many open problems remain.
Preprints at https://arxiv.org/abs/2302.05066 and https://arxiv.org/abs/2303.02529

More than 30 year ago Jerrum studied the planted clique problem and proved that under worst-case initialization Metropolis fails to recover planted cliques of size $\ll n^{1/2}$ in the Erdős-Rényi graph $G(n,1/2)$. This result is classically cited in the literature of the problem, as the "first evidence" that finding planted cliques of size much smaller than square root $n$ is "algorithmically hard". Cliques of size $\gg n^{1/2}$ are easy to find using simple algorithms. In a recent work we show that the Metropolis process actually fails to find planted cliques under worst-case initialization for cliques up to size almost linear in $n$. Thus the algorithm fails well beyond the $\sqrt{n}$ "conjectured algorithmic threshold". We also prove that, for a large parameter regime, that the Metropolis process fails also under "natural initialization". Our results resolve some open questions posed by Jerrum in 1992. Based on joint work with Zongchen Chen and Iias Zadik.

PhD_course_Roux_0.pdf

We will start from the description of a particle system modelling a finite size network of interacting neurons described by their voltage. After a quick description of the non-rigorous and rigorous mean-field limit results, we will do a detailed analytical study of the associated Fokker-Planck equation, which will be the occasion to introduce in context powerful general methods like the reduction to a free boundary Stefan-like problem, the relative entropy methods, the study of finite time blowup and the numerical and theoretical exploration of periodic solutions for the delayed version of the model. I will then present some variants and related models, like nonlinear kinetic Fokker-Planck equations and continuous systems of Fokker-Planck equations coupled by convolution.

Generating n-tuples of a group G, or in other words epimorphisms Fₙ→G are usually studied up to the natural right action of Aut(Fₙ) on Epi(Fₙ,G); here Fₙ is the free group of n generators. The orbits are then called Nielsen classes. It is a classic result of Nielsen that for any n ≥ k there is exactly one Nielsen class of generating n-tuples of Fₖ. This result was generalized to surface groups by Louder.

In this talk the case of Fuchsian groups is discussed. It turns out that the situation is much more involved and interesting. While uniqueness does not hold in general one can show that each class is represented by some unique geometric object called an "almost orbifold covers". This can be thought of as a classification of Nielsen classes. This is joint work with Ederson Dutra.

TBA

A self-similar group is a group $G$ acting on a regular, infinite rooted tree by automorphisms in such a way that the self-similarity of the tree is reflected in the group. The most common examples are generated by the states of a finite automaton. Many famous groups, like Grigorchuk's 2-group of intermediate growth, are of this form. Nekrashevych associated $C^*$-algebras and algebras with coefficients in a field to self-similar groups. In the case $G$ is trivial, the algebra is the classical Leavitt algebra, a famous finitely presented simple algebra. Nekrashevych showed that the algebra associated to the Grigorchuk group is not simple in characteristic 2, but Clark, Exel, Pardo, Sims, and Starling showed its Nekrashevych algebra is simple over all other fields. Nekrashevych then showed that the algebra associated to the Grigorchuk-Erschler group is not simple over any field (the first such example). The Grigorchuk and Grigorchuk-Erschler groups are contracting self-similar groups. This important class of self-similar groups includes Gupta-Sidki p-groups and many iterated monodromy groups like the Basilica group. Nekrashevych proved algebras associated to contacting groups are finitely presented.

In this talk, we discuss a result of the speaker and Benjamin Steinberg characterizing simplicity of Nekrashevych algebras of contracting groups. In particular, we give an algorithm for deciding simplicity given an automaton generating the group. We apply our results to several families of contracting groups like GGS groups and Sunic's generalizations of Grigorchuk's group associated to polynomials over finite fields.

For a reductive group defined over a p-adic field, the wavefront set is an invariant of an admissible representations which roughly speaking measures the direction of the singularities of the character near the identity. Studied first by Roger Howe in the 70s, the wavefront set has important connections to Arthur packets, and has been the subject of thorough investigation in the intervening years. One of main lines of inquiry is to determine the relation between the wavefront set and the L-parameter of a representation. In this talk we present new results answering this question for unipotent representations with real infinitesimal character. The results are joint with Dan Ciubotaru and Lucas Mason-Brown.

General Relativity and Quantum Theory are the two main achievements of physics in the 20th century. Even though they have greatly enlarged the physical understanding of our universe, there are still situations which are completely inaccessible to us, most notably the Big Bang and the inside of black holes: These circumstances require a theory of Quantum Gravity — the unification of General Relativity with Quantum Theory. The most natural approach for that would be the application of the astonishingly successful methods of perturbative Quantum Field Theory to the graviton field, defined as the deviation of the metric with respect to a fixed background metric. Unfortunately, this approach seemed impossible due to the non-renormalizable nature of General Relativity. In this talk, I aim to give a pedagogical introduction to this topic, in particular to the Lagrange density, the Feynman graph expansion and the renormalization problem of their associated Feynman integrals. Finally, I will explain how this renormalization problem could be overcome by an infinite tower of gravitational Ward identities, as was established in my dissertation and the articles it is based upon, cf. arXiv:2210.17510 [hep-th].

We talk about the Hausdorff measure of level sets of the fields, say length of level lines of a planar field. Given two coupled stationary fields  $f_1, f_2$ , we estimate the difference of Hausdorff measure of level sets in expectation, in terms of $C^2$-fluctuations of the field $F=f_1-f_2$. The main idea in the proof is to represent difference in volume as an integral of mean curvature using the divergence theorem. This approach is different from using the Kac-Rice type formula as the main tool in the analysis. 

Reaction–diffusion equations are widely used to model spatial propagation, and constant-speed "traveling waves" play a central role in their dynamics. These waves are well understood in "essentially 1D" domains like cylinders, but much less is known about waves with noncompact transverse structure. In this direction, we will consider traveling waves of the KPP reaction–diffusion equation in the Dirichlet half-space. We will see that minimal-speed waves are unique (unlike faster waves) and exhibit curious asymptotics. The arguments rest on potential theory, the maximum principle, and a powerful connection with the probabilistic system known as branching Brownian motion.

This is joint work with Julien Berestycki, Yujin H. Kim, and Bastien Mallein.

It is known that there exists certain randomness in the values of the Moebius function. It is widely believed that this randomness predicts significant cancellations in the summation of the Moebius function times any 'reasonable' sequence. This rather vague principle is known as an instance of the 'Moebius randomness principle'. Sarnak made this principle precise by identifying the notion 'reasonable' as deterministic. More precisely, Sarnak's Moebius Disjointness Conjecture predicts the disjointness of the Moebius function from any arithmetic functions realized in any topological dynamical systems of zero topological entropy. In this talk, I will firstly introduce some background and progress on this conjecture. Secondly, I will talk about some of my work on this. Thirdly, I will talk some related problems to this conjecture.

Given a 4-dimensional Einstein orbifold that cannot be desingularized by smooth Einstein metrics, we investigate the existence of an ancient solution to the Ricci flow coming out of such a singular space. In this talk, we will focus on singularities modeled on a cone over $\mathbb{R}P^3$ that are desingularized by gluing Eguchi-Hanson metrics to get a first approximation of the flow. We show that a parabolic version of the corresponding obstructed gluing problem has a  smooth solution: the bubbles are shown to grow exponentially in time, a phenomenon that is intimately connected to the instability of such orbifolds. Joint work with Tristan Ozuch.

Accurately predicting turbulent fluid mechanics remains a significant challenge in engineering and applied science. Reynolds-Averaged Navier–Stokes (RANS) simulations and Large-Eddy Simulation (LES) are generally accurate, though non-Boussinesq turbulence and/or unresolved multiphysical phenomena can preclude predictive accuracy in certain regimes. In turbulent combustion, flame–turbulence interactions lead to inverse-cascade energy transfer, which violates the assumptions of many RANS and LES closures. We survey the regime dependence of these effects using a series of high-resolution Direct Numerical Simulations (DNS) of turbulent jet flames, from which an intermediate regime of heat-release effects, associated with the hypothesis of an “active cascade,” is apparent, with severe implications for physics- and data-driven closure models. We apply adjoint-based data assimilation method to augment the RANS and LES equations using trusted (though not necessarily high-fidelity) data. This uses a Python-native flow solver that leverages differentiable-programming techniques, automatic construction of adjoint equations, and solver-in-the-loop optimization. Applications to canonical turbulence, shock-dominated flows, aerodynamics, and flow control are presented, and opportunities for reacting flow modeling are discussed.

There has been recent advances in understanding the microscopic origin of the Bekenstein-Hawking entropy of supersymmetric ant de Sitter (AdS) black holes using holography and localization applied to the dual quantum field theory. In this talk, after a brief overview of the general picture, I will propose a BPS partition function -- based on gluing elementary objects called gravitational blocks -- for known AdS black holes with arbitrary rotation and generic magnetic and electric charges. I will then show that the attractor equations and the Bekenstein-Hawking entropy can be obtained from an extremization principle.

Come to this session to learn how to get started in consultancy from Dawn Gordon at Oxford University Innovation (OUI). After an introduction to what consultancy is, we'll explore case studies of consultancy work performed by mathematicians and statisticians within the university. This session will also include practical advice on how you can explore consultancy opportunities alongside your research work, from finding potential clients to the support that OUI can offer.

In this talk, I will present the notion of projected barcodes and projected distances for multi-parameter persistence modules. Projected barcodes are defined as derived pushforward of persistence modules onto R. Projected distances come in two flavors: the integral sheaf metrics (ISM) and the sliced convolution distances (SCD). I will explain how the fibered barcode is a particular instance of projected barcodes and how the ISM and the SCD provide lower bounds for the convolution distance. 

Furthermore, in the case where the persistence module considered is the sublevel-sets persistence modules of a function f : X -> R^n, we will explain how, under mild conditions, the projected barcode of this module by a linear map u : R^n \to R is the collection of sublevel-sets barcodes of the composition uf . In particular, it can be computed using software dedicated to one-parameter persistence modules. This is joint work with Nicolas Berkouk.

Habegger showed that a subvariety of a fibre power of the Legendre family of elliptic curves is special if and only if it contains a Zariski-dense set of special points. I'll discuss joint work with Gal Binyamini, Harry Schmidt, and Margaret Thomas in which we use pfaffian methods to obtain an effective uniform version of Manin-Mumford for products of CM elliptic curves. Using this we then prove an effective version of Habegger's result.

I will explain a new construction of an Euler system for the symmetric square of an eigenform and its connection with L-values. The construction makes use of some simple Eisenstein cohomology classes for Sp(4) or, equivalently, SO(3,2). This is an example of a larger class of similarly constructed Euler systems.  This is a report on joint work with Marco Sangiovanni Vincentelli.

Given a non-orientable Lagrangian surface L in a symplectic 4-manifold, how far
can the cohomology class of the symplectic form be deformed before there is no
longer a Lagrangian isotopic to L? I will properly introduce this and a
related question, both of which are less interesting for orientable
Lagrangians due to topological conditions. The majority of this talk will be
an exposition on Evans' 2020 work in which he solves this deformation
question for a particular Klein bottle. The proof employs the heavy machinery
of symplectic field theory and more classical pseudoholomorphic
curve theory to severely constrain the topology and intersection properties of
the limits of certain pseudoholomorphic curves under a process called
neck-stretching. The treatment of SFT-related material will be light and focus
mainly on how one can use the compactness theorem to prove interesting things.