Past

I shall present a new flexible method showing that every countable model of PA admits a pointwise definable end-extension, one in which every point is definable without parameters. Also, any model of PA of size at most continuum admits an extension that is Leibnizian, meaning that any two distinct points are separated by some expressible property. Similar results hold in set theory, where one can also achieve V=L in the extension, or indeed any suitable theory holding in an inner model of the original model.

Many problems in number theory are equivalent to determining all of the rational points on some curve or family of curves. In general, finding all the rational points on any given curve is a challenging (even unsolved!) problem. 

The focus of this talk is rational points on so-called Erdős-Selfridge curves. A deep conjecture of Sander, still unproven in many cases, predicts all of the rational points on these curves. 

I will describe work-in-progress proving new cases of Sander's conjecture, and sketch some ideas in the proof. The core of the proof is a `mass increment argument,' which is loosely inspired by various increment arguments in additive combinatorics. The main ingredients are a mixture of combinatorial ideas and quantitative estimates in Diophantine geometry.

We apply machine learning models to forecast intraday realized volatility (RV), by exploiting commonality in intraday volatility via pooling stock data together, and by incorporating a proxy for the market volatility. Neural networks dominate linear regressions and tree-based models in terms of performance, due to their ability to uncover and model complex latent interactions among variables. Our findings remain robust when we apply trained models to new stocks that have not been included in the training set, thus providing new empirical evidence for a universal volatility mechanism among stocks. Finally, we propose a new approach to forecasting one-day-ahead RVs using past intraday RVs as predictors, and highlight interesting time-of-day effects that aid the forecasting mechanism. The results demonstrate that the proposed methodology yields superior out-of-sample forecasts over a strong set of traditional baselines that only rely on past daily RVs.

Linear poroelasticity models have important applications in biology and geophysics. In particular, the well-known Biot consolidation model describes the coupled interaction between the linear response of a porous elastic medium saturated with fluid and a diffusive fluid flow within it, assuming small deformations. This is the starting point for modeling human organs in computational medicine and for modeling the mechanics of permeable
rock in geophysics. Finite element methods for Biot’s consolidation model have been widely studied over the past four decades.
In the first part of the talk, we discuss a posteriori error estimators for locking-free mixed finite element approximation of Biot’s consolidation model. The simplest of these is a conventional residual-based estimator. We establish bounds relating the estimated and true errors, and show that these are independent of the physical parameters. The other two estimators require the solution of local problems. These local problem estimators are also shown to be reliable, efficient and robust. Numerical results are presented that
validate the theoretical estimates, and illustrate the effectiveness of the estimators in guiding adaptive solution algorithms.
In the second part of talk, we discuss a novel locking-free stochastic Galerkin mixed finite element method for the Biot consolidation model with uncertain Young’s modulus and hydraulic conductivity field. After introducing a five-field mixed variational formulation of the standard Biot consolidation model, we discuss stochastic Galerkin mixed finite element approximation, focusing on the issue of well-posedness and efficient linear algebra for the discretized system. We introduce a new preconditioner for use with MINRES and
establish eigenvalue bounds. Finally, we present specific numerical examples to illustrate the efficiency of our numerical solution approach.

Finally, we discuss some remarks related to non-conforming approximation of Biot’s consolidation model.

References:
1. A. Khan, D. J. Silvester, Robust a posteriori error estimation for mixed finite
element approximation of linear poroelsticity, IMA Journal of Numerical Analysis, Oxford University Press, 41 (3), 2021, 2000-2025.
2. A. Khan, C. E. Powell, Parameter-robust stochastic Galerkin approxination for linear poroelasticity with uncertain inputs, SIAM Journal on Scientific Computing (SISC), 43 (4), 2021, B855-B883.
3. A. Khan, P. Zanotti, A nonsymmetric approach and a quasi-optimal and robust discretization for the Biot’s model. Mathematics of Computation, 91 (335), 2022, 1143-1170.
4. V. Anaya, A. Khan, D. Mora, R. Ruiz-Baier, Robust a posteriori error analysis for rotation-based formulations of the elasticity/poroelasticity coupling, SIAM Journal
on Scientific Computing (SISC), 2022.

My talk will have two parts. First, I will tell you how a single cell produces light to survive; then, I will explain how a huddle of chloroplasts in cells form glasses to optimize plant life. Part I: Bioluminescence (light generation in living organisms) has mesmerized humans since thousands of years ago. I will first go over the recent progress in experimental and mathematical biophysics of single-cell bioluminescence (PRL 125 (2), 028102, 2020) and then will go beyond and present a lab-scale experiment and a continuum model of bioluminescent breaking waves. Part II: To remain efficient during photosynthesis, plants can re-arrange the internal structure of cells by the active motion of chloroplasts. I will show that the chloroplasts can behave like a densely packed light-sensitive active matter, whose non-gaussian athermal fluctuations can lead to various self-organization scenarios, including glassy dynamics under dim lights (PNAS 120 (3), 2216497120, 2023). To this end, I will also present a simple model that captures the dynamic of these biological glasses.

The virtual Haken theorem is one of the most influential recent results in 3-manifold theory. The statement dates back to Waldhausen, who conjectured that every aspherical closed 3-manifold has a finite cover containing an essential embedded closed surface. The proof is usually attributed to Agol, although his virtual special theorem is only the last piece of the puzzle. This talk is dedicated to the unsung heroes of virtual Haken, the mathematicians whose invaluable work helped turning this conjecture into a theorem. We will trace the history of a mathematical thread that connects Thurston-Perelman's geometrisation to Agol's final contribution, surveying Kahn-Markovic's surface subgroup theorem, Bergeron-Wise's cubulation of 3-manifold groups, Haglund-Wise's special cube complexes, Wise's work on quasi-convex hierarchies and Agol-Groves-Manning's weak separation theorem.

In 1986, Katznelson and Tzafriri proved that, if $T$ is a power-bounded operator on a Banach space $X$, and the spectrum of $T$ meets the unit circle only at 1, then $\|T^n(I-T)\| \to 0$ as $n\to\infty$. Actually, they went further and proved that $\|T^nf(T)\| \to 0$ if $T$ and $f$ satisfy certain conditions. Soon afterward, analogous results were obtained for bounded $C_0$-semigroups $(T(t))_{t\ge0}$. Further extensions and variants were proved later. I will speak about several extensions to the Katznelson-Tzafriri theorem(s), including in particular a recent result(s) obtained by David Seifert and myself.

COURSE_PROPOSAL (12)_0.pdf

The space of unordered tuples. The notion of differentiability and the theory of metric Sobolev in the context of multi-valued functions. Multivalued maximum principle and Holder regularity. Estimates on the Hausdorff dimension of the singular set of Dir-minimizing functions. If time permits: mass minimizing currents and their link with Dir-minimizers. 

A parabolic representation of the free group  is one in which the images of both generators are parabolic elements of $PSL(2,\IC)$. The Riley slice is a closed subset ${\cal R}\subset \IC$ which is a model for the moduli space of parabolic, discrete and faithful representations. The complement of the Riley slice is a bounded Jordan domain within which there are isolated points, accumulating only at the boundary, corresponding to parabolic discrete and faithful representations of rigid subgroups of $PSL(2,\IC)$. Recent work of Aimi, Akiyoshi, Lee, Oshika, Parker, Lee, Sakai, Sakuma \& Yoshida, have topologically identified all these groups. Here we give the first  substantive properties of the nondiscrete representations using ergodic properties of the action of a polynomial semigroup and identifying the Riley slice as the ``Julia set’’ of this dynamical system. We prove a supergroup density theorem: given any irreducible parabolic representation of $F_2$ whatsoever, {\em any}  non-discrete parabolic representation has an arbitrarily small perturbation which contains that group as a conjugate.  Using these ideas we then show that there are nondiscrete parabolic representations with an arbitrarily large number of distinct Nielsen classes of parabolic generators.

 Wide Neural Networks are well known for their Gaussian Process behaviour. Based upon this fact, an initialisation scheme for the weights and biases of a network preserving some geometrical properties of the input data is presented — The edge-of-chaos. This talk will introduce such a scheme before briefly mentioning a recent contribution related to the edge-of-chaos dynamics of wide randomly initialized low-rank feedforward networks. Formulae for the optimal weight and bias variances are extended from the full-rank to low-rank setting and are shown to follow from multiplicative scaling. The principle second order effect, the variance of the input-output Jacobian, is derived and shown to increase as the rank to width ratio decreases. These results inform practitioners how to randomly initialize feedforward networks with a reduced number of learnable parameters while in the same ambient dimension, allowing reductions in the computational cost and memory constraints of the associated network.

Let $p_c$ and $q_c$ be the threshold and the expectation threshold, respectively, of an increasing family $F$ of subsets of a finite set $X$. Recently, Park and Pham proved Kahn–Kalai conjecture stating that a not-too-large multiple of $q_c$ is an upper bound on $p_c$. In the talk, I will present a slight improvement to the Park–Pham theorem, which is obtained from transferring the threshold result from the small $p$ regime to general $p$. Based on joint work with Oliver Riordan.

Complex networks usually exhibit a rich architecture organized over multiple intertwined scales. Information pathways are expected to pervade these scales reflecting structural insights that are not manifest from analyses of the network topology. Moreover, small-world effects correlate with the different network hierarchies complicating identifying coexisting mesoscopic structures and functional cores. We present a communicability analysis of effective information pathways throughout complex networks based on information diffusion to shed further light on these issues. This leads us to formulate a new renormalization group scheme for heterogeneous networks. The Renormalization Group is the cornerstone of the modern theory of universality and phase transitions, a powerful tool to scrutinize symmetries and organizational scales in dynamical systems. However, its network counterpart is particularly challenging due to correlations between intertwined scales. The Laplacian RG picture for complex networks defines both the supernodes concept à la Kadanoff, and the equivalent momentum space procedure à la Wilson for graphs.

The pro-C completion of a free profinite group on an infinite set of generators is a profinite group of a greater rank. However, it is still not known whether it is a free profinite group too.  We will discuss this question, present a positive answer for some special varieties, and show partial results regarding the general case. In addition, we present the infinite tower of profinite completions, which leads to a generalisation for completions of higher orders. 

Placeholder entry; date+time TBC. 

Abstract for talk: In this talk, we present a systematic discretization of the Bernstein-Gelfand-Gelfand (BGG) diagrams and complexes over cubical meshes of arbitrary dimension via the use of tensor-product structures of one-dimensional piecewise-polynomial spaces, such as spline and finite element spaces. We demonstrate the construction of the Hessian, the elasticity, and div-div complexes as examples for our construction.

PDEs frequently exhibit certain physical structures that guide their behaviour, e.g. energy/helicity dissipation, Hamiltonians, and material conservation. Preserving these structures during numerical discretisation is essential.

Although the finite-element method has proven powerful in constructing such models, incorporating inhomogeneous(/non-zero) boundary conditions has been a significant challenge. We propose a technique that addresses this issue, deriving structure-preserving models for diverse inhomogeneous problems.

Moreover, this technique enables the derivation of novel structure-preserving timesteppers for time-dependent problems. Analogies can be drawn with the other workhorse of modern structure-preserving methods: symplectic integrators.

I will discuss a formulation of an Abelian Chern-Simons theory on the lattice employing the modified Villain formalism. The theory suffers from a well-known problem of having extra zero modes in the Gaussian operator. I will argue that these zero modes are associated with a kind of subsystem symmetry which projects out almost all naive Wilson loops. The operators which survive are framed Wilson loops. These turn out to be topological charges of the associated one-form symmetry, and it has the correct topological spin and correlation functions.

This will be a continuation of the talk from last week (9 May). 

The talk is focused on the clamped plate problem, initially formulated by Lord Rayleigh in 1877, and solved by M. Ashbaugh & R. Benguria (Duke Math. J., 1995) and N. Nadirashvili (Arch. Ration. Mech. Anal., 1995) in 2 and 3 dimensional euclidean spaces. We consider the same problem on both negatively and positively curved spaces, and provide various answers depending on the curvature, dimension and the width/size of the clamped plate.

Let $p$ be a prime, let $1 \le t < d < p$ be integers, and let $S$ be a non-empty subset of $\mathbb{F}_p$ (which may be thought of as being $\{0,1\}$). We will establish that if a polynomial $P:\mathbb{F}_p^n \to \mathbb{F}_p$ with degree $d$ is such that the image $P(S^n)$ does not contain the full image $A(\mathbb{F}_p)$ of any non-constant polynomial $A: \mathbb{F}_p \to \mathbb{F}_p$ with degree at most $t$, then $P$ coincides on $S^n$ with a polynomial $Q$ that in particular has bounded degree-$\lfloor d/(t+1) \rfloor$-rank in the sense of Green and Tao, and has degree at most $d$. Likewise, we will prove that if the assumption holds even for $t=d$ then $P$ coincides on $S^n$ with a polynomial determined by a bounded number of coordinates and with degree at most $d$.

Questions about the geometry of G-representation varieties on a manifold M have attracted many researchers as the theory combines the algebraic geometry of G, the topology of M, and the group theory and representation theory of G and the fundamental group of M. In this talk, I will explain how to construct a Topological Quantum Field Theory to compute virtual classes of character stacks (G-representation varieties equipped with the adjoint G-action) in the Grothendieck ring of stacks. I will also show a few features of the construction (for instance, how to obtain arithmetic information) focusing on a couple of simple examples.
The work is joint with Jesse Vogel and Ángel González-Prieto.  

Recently there is a rising interest in the research of mean-field optimization, in particular because of its role in analyzing the training of neural networks. In this talk, by adding the Fisher Information (in other word, the Schrodinger kinetic energy) as the regularizer, we relate the mean-field optimization problem with a so-called mean field Schrodinger (MFS) dynamics. We develop a free energy method to show that the marginal distributions of the MFS dynamics converge exponentially quickly towards the unique minimizer of the regularized optimization problem. We shall see that the MFS is a gradient flow on the probability measure space with respect to the relative entropy. Finally we propose a Monte Carlo method to sample the marginal distributions of the MFS dynamics. This is a joint work with Giovanni Conforti, Zhenjie Ren and Songbo Wang.

I will discuss a joint work with Olivier Biquard about degenerating conic Kähler-Einstein metrics by letting the cone angle go to zero. In the case where one is given a smooth anticanonical divisor $D$ in a Fano manifold $X$, I will explain how the complete Ricci flat Tian-Yau metric on $X \smallsetminus D$ appears as rescaled limit of such conic KE metrics. 

We present a homotopy-theoretic method for calculating Ext groups between polynomial functors from the category of (finitely generated, free) groups to abelian groups. It enables us to substantially extend the range of what can be calculated. In particular, we can calculate torsion in the Ext groups, about which very little has been known. We will discuss some applications to the stable cohomology of Aut(F_n), based on a theorem of Djament.   

I will discuss how to place conformal boundary conditions on free higher derivative theories of scalars and spinors as well as the zoo of boundary renormalization group flows that connect the different boundary conditions.  Historically, there are connections to Poisson’s ratio and classical equations governing the bending of thin steel plates.  As these higher derivative theories are often invoked in the context of cosmology, there may be cosmological applications for the boundary conditions discussed here.
 

Title: When data driven reduced order modelling meets full waveform inversion

Abstract:

This talk is concerned with the following inverse problem for the wave equation: Determine the variable wave speed from data gathered by a collection of sensors, which emit probing signals and measure the generated backscattered waves. Inverse backscattering is an interdisciplinary field driven by applications in geophysical exploration, radar imaging, non-destructive evaluation of materials, etc. There are two types of methods:

(1) Qualitative (imaging) methods, which address the simpler problem of locating reflective structures in a known host medium. 

(2) Quantitative methods, also known as velocity estimation. 

Typically, velocity estimation is  formulated as a PDE constrained optimization, where the data are fit in the least squares sense by the wave computed at the search wave speed. The increase in computing power has lead to growing interest in this approach, but there is a fundamental impediment, which manifests especially for high frequency data: The objective function is not convex and has numerous local minima even in the absence of noise.

The main goal of the talk is to introduce a novel approach to velocity estimation, based on a reduced order model (ROM) of the wave operator. The ROM is called data driven because it is obtained from the measurements made at the sensors. The mapping between these measurements and the ROM is nonlinear, and yet the ROM can be computed efficiently using methods from numerical linear algebra. More importantly, the ROM can be used to define a better objective function for velocity estimation, so that gradient based optimization can succeed even for a poor initial guess.

TBC

The mod p Langlands program is an attempt to relate mod p Galois representations of a local field to mod p representations of the p-adic points of a reductive group. This is inspired by the classical local Langlands (l-adic coefficients) and it is partially a stepping stone towards the p-adic Langlands (p-adic coefficients). I will explain this for GL2/Qp, where one can explicitly describe both sides, and I will relate it to congruences between modular forms. 

A conjecture due to Zilber predicts that the complex exponential field is quasiminimal: that is, that all subsets of the complex numbers that are definable in the language of rings expanded by a symbol for the complex exponential function are countable or cocountable.
Zilber showed that this conjecture would follow from Schanuel's Conjecture and an existential closedness type property asserting that certain systems of exponential-polynomial equations can be solved in the complex numbers; later on, Bays and Kirby were able to remove the dependence on Schanuel's Conjecture, shifting all the focus to the existence of solutions. In this talk, I will discuss recent work about the quasiminimality of a reduct of the complex exponential field, that is, the complex numbers expanded by multivalued power functions. This is joint work with Jonathan Kirby.

Nonlinear filtering is a central mathematical tool in understanding how we process information. Unfortunately, the equations involved are often high dimensional, and therefore, in practical applications, approximate filters are often employed in place of the optimal filter. The error introduced by using these approximations is generally poorly understood. In this talk we will see how, in the case where the underlying process is a continuous-time, finite-state Markov Chain, results on the stability of filters can be strengthened to yield bounds for the error between the optimal filter and a general approximate filter.  We will then consider the 'projection filter', a low dimensional approximation of the filtering equation originally due to D. Brigo and collaborators, and show that its error is indeed well-controlled. The talk is based on joint work with Sam Cohen.

We propose to use stochastic Riemannian coordinate descent on the Stiefel manifold for deep neural network training. The algorithm rotates successively two columns of the matrix, an operation that can be efficiently implemented as a multiplication by a Givens matrix. In the case when the coordinate is selected uniformly at random at each iteration, we prove the convergence of the proposed algorithm under standard assumptions on the loss function, stepsize and minibatch noise. Experiments on benchmark deep neural network training problems are presented to demonstrate the effectiveness of the proposed algorithm.

We will look at the vanishing of group cohomology from the perspective of Kazhdan’s property (T). We will investigate an analogue of this property for any degree, introduced by U. Bader and P. W. Nowak in 2020 and describe a method of proving these properties with computers.

Female PhD students and Postdocs will be giving short talks about their research. This will be followed by a Q&A and a chance to mingle with the speakers over lunch.

Speakers:

• Rhiannon Savage, DPhil Student in Algebra and Geometry
• Shanshan Hua, DPhil Student in Functional Analysis
• Silvia Butti, Postdoc in Theoretical Computer Science
• Anna Berryman, DPhil Student in OCIAM (Oxford Centre for Industrial and Applied Mathematics)
• Carmen Jorge Diaz, DPhil Student in Mathematical Physics

The Calogero-Painlevé systems were introduced in 2001 by K. Takasaki as a natural generalization of the classical Painlevé equations to the case of the several Painlevé “particles” coupled via the Calogero type interactions. In 2014, I. Rumanov discovered a remarkable fact that a particular case of the Calogero– Painlevé II equation describes the Tracy-Widom distribution function for the general $\beta$-ensembles with the even values of parameter $\beta$. in 2017 work of M. Bertola, M. Cafasso , and V. Rubtsov, it was proven that all Calogero-Painlevé systems are Lax integrable, and hence their solutions admit a Riemann-Hilbert representation. This important observation has opened the door to rigorous asymptotic analysis of the Calogero-Painlevé equations which in turn yields the possibility of rigorous evaluation of the asymptotic behavior of the Tracy-Widom distributions for the values of $\beta$ beyond the classical $\beta =1, 2, 4$. In the talk these recent developments will be outlined with a special focus on the Calogero-Painlevé system corresponding to $\beta = 6$. This is a joint work with Andrei Prokhorov.

Wreath-like products are a new class of groups, which are close relatives of the classical wreath products. Examples of wreath-like product groups arise from every non-elementary hyperbolic groups by taking suitable quotients. As a consequence, unlike classical wreath products, many wreath-like products have Kazhdan's property (T). 

I will present several rigidity results for von Neumann algebras of wreath-like product groups. We show that any group G in a natural family of wreath-like products with property (T) is W*-superrigid: the group von Neumann algebra L(G) remembers the isomorphism class of G. This provides the first examples of W*-superrigid groups with property (T). For a wider class wreath-like products with property (T), we show that any isomorphism of their group von Neumann algebras arises from an isomorphism of the groups. As an application, we prove that any countable group can be realized as the outer automorphism group of L(G), for an icc property (T) group G. These results are joint with Ionut Chifan, Denis Osin and Bin Sun.  

Time permitting, I will mention an additional application of wreath-like products obtained in joint work with Ionut Chifan and Daniel Drimbe, and showing that any separable II_1 factor is contained in one with property (T). This provides an operator algebraic counterpart of the group theoretic fact that every countable group is contained in one with property (T).

COURSE_PROPOSAL (12).pdf

The space of unordered tuples. The notion of differentiability and the theory of metric Sobolev in the context of multi-valued functions. Multivalued maximum principle and Holder regularity. Estimates on the Hausdorff dimension of the singular set of Dir-minimizing functions. If time permits: mass minimizing currents and their link with Dir-minimizers. 

To a group theorist ribbon groups look like knot groups, except  that we know everything about knot groups and next to nothing about ribbon groups.

I will talk about an old paper of mine with Peter Teichner where several questions on ribbon groups naturally arise.

"Colouring" a tournament means partitioning its vertex set into acylic subsets; and the "domination number" is the size of the smallest set of vertices with no common in-neighbour. In some ways these are like the corresponding concepts for graphs, but in some ways they are very different. We give a survey of some recent results and open questions on these topics.

Joint with Tung Nguyen and Alex Scott.

The Satake isomorphism is a fundamental result in p-adic groups, and the affine Grassmannian is the natural setting where this geometrizes to the Geometric Satake Correspondence. In fact, it suffices to work with affine Grassmannian slices, which retain all of the information.

Recently, Braverman, Finkelberg, and Nakajima showed that affine Grassmannian slices arise as Coulomb branches of certain quiver gauge theories. Remarkably, their construction works in Kac-Moody type as well. Their work opens the door to studying affine Grassmannians and Geometric Satake Correspondence for Kac-Moody groups. Unfortunately, it is difficult at present to do any explicit geometry with the Coulomb branch definition. For example, a basic feature is that affine Grassmannian slices embed into one another. However, this is not apparent from the Coulomb branch definition. In this talk, I will explain why these embeddings are necessarily subtle. Nonetheless, I will show a way to construct the embeddings using fundamental monopole operators.

This is joint work with Alex Weekes.

Supersymmetric localization allows one to reduce the computation of the partition function of a supersymmetric theory to a finite-dimensional integral, but the space over which one integrates is often singular. In this talk I will explain how one can use shifted symplectic geometry to get rigorous definitions of partition functions and state spaces in theories with extended supersymmetry. For instance, this gives a field-theoretic origin of DT invariants of CY4 manifolds. This is a report on joint work with Brian Williams.

Diffusion Limited Aggregation is a very simple mathematical model which describes a wide range of natural phenomena. Despite its simplicity, there is very little progress in understanding its large-scale structure. Since its introduction by Witten and Sander over 40 years ago, there was only one mathematical result. In 1987 Kesten obtained an upper bound on the growth rate. In this talk I will discuss DLA and some related models and the recent progress in understanding DLA. In particular, a new simpler proof of Kesten result which generalizes to other aggregation models.

Quasiconvexity is the fundamental existence condition for variational problems, yet it is poorly understood. Two outstanding problems remain: 

• 1) does rank-one convexity, a simple necessary condition, imply quasiconvexity in two dimensions? 

• 2) can one prove existence theorems for quasiconvex energies in the context of nonlinear Elasticity? 

In this talk we show that both problems have a positive answer in a special class of isotropic energies. Our proof combines complex analysis with the theory of gradient Young measures. On the way to the main result, we establish quasiconvexity inequalities for the Burkholder function which yield, in particular, many sharp higher integrability results. 
The talk is based on joint work with Kari Astala, Daniel Faraco, Aleksis Koski and Jan Kristensen.