Past

The talk will introduce two general models of random simplicial complexes which extend the highly studied Erdös-Rényi model for random graphs. These models include the well known probabilistic models of random simplicial complexes from Costa-Farber, Kahle, and Linial-Meshulam as special cases. These models turn out to have a satisfying Alexander duality relation between them prompting the hope that information can be transferred for free between them. This turns out to not quite be the case with vanishing probability parameters, but when all parameters are uniformly bounded the duality relation works a treat. Time permitting I may talk about the Rado simplicial complex, the unique (with probability one) infinite random simplicial complex.
This talk is based on various bits of joint work with Michael Farber, Tahl Nowik, and Lewin Strauss.

Mathematicians need to talk and write about their mathematics.  This includes undergraduates and MSc students, who may be writing a dissertation or project report, preparing a presentation on a summer research project, or preparing for a job interview.  We think that it can be helpful to think of this as a form of storytelling, as this can lead to more effective communication.  For a story to be engaging you also need to know your audience.  In this session, we'll discuss what we mean by telling a mathematical story, give you some top tips from our experience, and give you a chance to think about how you might put this into practice.

Tensors are higher dimensional analogues of matrices, used to record data with multiple changing variables. Interpreting tensor data requires finding multi-linear stucture that depends on the application or context. I will describe a tensor-based clustering method for multi-dimensional data. The multi-linear structure is encoded as algebraic constraints in a linear program. I apply the method to a collection of experiments measuring the response of genetically diverse breast cancer cell lines to an array of ligands. In the second part of the talk, I will discuss low-rank decompositions of tensors that arise in statistics, focusing on two graphical models with hidden variables. I describe how the implicit semi-algebraic description of the statistical models can be used to obtain a closed form expression for the maximum likelihood estimate.

The famous Birch & Swinnerton-Dyer conjecture predicts that the (algebraic) rank of an elliptic curve is equal to the so-called analytic rank, which is the order of vanishing of the associated L-functions at the central point. In this talk, we shall discuss the analytic rank of automorphic L-functions in an "alternate universe". This is joint work with Kyle Pratt and Alexandru Zaharescu.

Your brain has its own waterscape: whether you are reading or sleeping, fluid flows around or through the brain tissue and clears waste in the process. These physiological processes are crucial for the well-being of the brain. In spite of their importance we understand them but little. Mathematics and numerics could play a crucial role in gaining new insight. Indeed, medical doctors express an urgent need for modeling of water transport through the brain, to overcome limitations in traditional techniques. Surprisingly little attention has been paid to the numerics of the brain’s waterscape however, and fundamental knowledge is missing. In this talk, I will discuss mathematical models and numerical methods for the brain's waterscape across scales - from viewing the brain as a poroelastic medium at the macroscale and zooming in to studying electrical, chemical and mechanical interactions between brain cells at the microscale.
 

This talk aims to provide a simple introduction on how to probe the
explicit geometry of certain moduli schemes arising in enumerative
geometry. Stable pairs, introduced by Pandharipande and Thomas in 2009, offer a curve-counting theory which is tamer than the Hilbert scheme of
curves used in Donaldson-Thomas theory. In particular, they exclude
curves with zero-dimensional or embedded components.

Ribbons are non-reduced schemes of dimension one, whose non-reduced
structure has multiplicity two in a precise sense. Following Ferrand, Banica, and Forster, there are several results on how to construct
ribbons (and higher non-reduced structures) from the data of line
bundles on a reduced scheme. With this approach, we can consider stable
pairs whose underlying curve is a ribbon: the remaining data is
determined by allowing devenerations of the line bundle defining the
double structure.

In this talk I will present a Perron-Frobenius type result for nonlinear eigenvector problems which allows us to compute the global maximum of a class of constrained nonconvex optimization problems involving multihomogeneous functions.

I will structure the talk into three main parts:

First, I will motivate the optimization of homogeneous functions from a graph partitioning point of view, showing an intriguing generalization of the famous Cheeger inequality.

Second, I will define the concept of multihomogeneous function and I will state our main Perron-Frobenious theorem. This theorem exploits the connection between optimization of multihomogeneous functions and nonlinear eigenvectors to provide an optimization scheme that has global convergence guarantees.

Third, I will discuss a few example applications in network science and machine learning that require the optimization of multihomogeneous functions and that can be solved using nonlinear Perron eigenvectors.

Computers can now beat humans at chess and at go. Surely one day they will beat us at proving theorems. But when will it happen, how will it happen, and what should humans be doing in order to make it happen? Furthermore -- do we actually want it to happen? Will they generate incomprehensible proofs, which teach us nothing? Will they find mistakes in the human literature?

I will talk about how I am training undergraduates at Imperial College London to do their problem sheets in a formal proof verification system, and how this gamifies mathematics. I will talk about mistakes in the modern pure mathematics literature, and ask what the point of modern pure mathematics is.

In this talk I will discuss some aspects of the potential theory, fine properties and boundary behaviour of the solutions to the Total Variation Flow. Instead of the classical Euclidean setting, we intend to work mostly in the general setting of metric measure spaces. During the past two decades, a theory of Sobolev functions and BV functions has been developed in this abstract setting.  A central motivation for developing such a theory has been the desire to unify the assumptions and methods employed in various specific spaces, such as weighted Euclidean spaces, Riemannian manifolds, Heisenberg groups, graphs, etc.

The total variation flow can be understood as a process diminishing the total variation using the gradient descent method.  This idea can be reformulated using parabolic minimizers, and it gives rise to a definition of variational solutions.  The advantages of the approach using a minimization formulation include much better convergence and stability properties.  This is a very essential advantage as the solutions naturally lie only in the space of BV functions. Our main goal is to give a necessary and sufficient condition for continuity at a given point for proper solutions to the total variation flow in metric spaces. This is joint work with Vito Buffa and Juha Kinnunen.

Limit groups are a powerful tool in the study of free and hyperbolic groups (and even broader classes of groups). I will define limit groups in various ways: algebraic, logical and topological, and draw connections between the different definitions. We will also see how one can equip a limit group with an action on a real tree, and analyze this action using the Rips machine, a generalization of Bass-Serre theory to real trees. As a conclusion, we will obtain that hyperbolic groups whose outer automorphism group is infinite, split non-trivially as graphs of groups.

Let $X$ be a countable discrete metric space, and think of operators on $\ell^2(X)$ in terms of their $X$-by-$X$ matrix. Band operators are ones whose matrix is supported on a "band" along the main diagonal; all norm-limits of these form a C*-algebra, called uniform Roe algebra of $X$. This algebra "encodes" the large-scale (a.k.a. coarse) structure of $X$. Quasi-locality, coined by John Roe in '88, is a property of an operator on $\ell^2(X)$, designed as a condition to check whether the operator belongs to the uniform Roe algebra (without producing band operators nearby). The talk is about our attempt to make this work, and an expander-ish condition on graphs that came out of trying to find a counterexample. (Joint with: A. Tikuisis, J. Zhang, K. Li and P. Nowak.)
 

This presentation introduces a rigorous framework for the study of commonly used machine learning techniques (kernel methods, random feature maps, etc.) in the regime of large dimensional and numerous data. Exploiting the fact that very realistic data can be modeled by generative models (such as GANs), which are theoretically concentrated random vectors, we introduce a joint random matrix and concentration of measure theory for data processing. Specifically, we present fundamental random matrix results for concentrated random vectors, which we apply to the performance estimation of spectral clustering on real image datasets.

We introduce a new and generic approximation to Schur complements arising from inf-sup stable mixed finite element discretizations of self-adjoint multi-physics problems. The approximation exploits the discretization mesh by forming local, or element, Schur complements and projecting them back to the global degrees of freedom. The resulting Schur complement approximation is sparse, has low construction cost (with the same order of operations as a general finite element matrix), and can be solved using off-the-shelf techniques, such as multigrid. Using the Ladyshenskaja-Babu\v{s}ka-Brezzi condition, we show that this approximation has favorable eigenvalue distributions with respect to the global Schur complement. We present several numerical results to demonstrate the viability of this approach on a range of applications. Interestingly, numerical results show that the method gives an effective approximation to the non-symmetric Schur complement from the steady state Navier-Stokes equations.
 

Let us fix a prime $p$. The Erdős-Ginzburg-Ziv problem asks for the minimum integer $s$ such that any collection of $s$ points in the lattice $\mathbb{Z}^n$ contains $p$ points whose centroid is also a lattice point in $\mathbb{Z}^n$. For large $n$, this is essentially equivalent to asking for the maximum size of a subset of $\mathbb{F}_p^n$ without $p$ distinct elements summing to zero.

In this talk, we discuss a new upper bound for this problem for any fixed prime $p\geq 5$ and large $n$. Our proof uses the so-called multi-colored sum-free theorem which is a consequence of the Croot-Lev-Pach polynomial method, as well as some new combinatorial ideas.

In STFC's Computational Mathematics Group, we work alongside scientists at large-scale National Facilities, such as ISIS Neutron and Muon source, Diamond Light Source, and the Central Laser Facility. For each of these groups, non-linear least squares fitting is a vital part of their scientific workflow. In this talk I will describe FitBenchmarking, a software tool we have developed to benchmark the performance of different non-linear least squares solvers on real-world data. It is designed to be easily extended, so that new data formats and new minimizers can be added. FitBenchmarking will allow (i) scientists to determine objectively which fitting engine is optimal for solving their problem on their computing architecture, (ii) scientific software developers to quickly test state-of-the-art algorithms in their data analysis software, and (iii) mathematicians and numerical software developers to test novel algorithms against realistic datasets, and to highlight characteristics of problems where the current best algorithms are not sufficient.
 

Real networks are highly clustered (large number of short cycles) in contrast with their random counterparts. The Erdős–Rényi model and the Configuration model will generate networks with a tree like structure, a feature rarely observed in real networks. This means that traditional random networks are a poor choice as null models for real networks. Can we do better than that? Maximum entropy random graph ensembles are the natural choice to generate such networks. By introducing a bias with respect to the number of short cycles in a degree constrained graph, we aim to get a random graph model with a tuneable number of short cycles [1,2]. Nevertheless, the story is not so simple. In the same way random unclustered graphs present undesired topology, highly clustered ones will do as well if one is not careful with the scaling of the control parameters relative to the system size. Additionally the techniques to generate and sample numerically from general biased degree constrained graph ensembles will also be discussed. The topological transition has an important impact on the computational cost to sample graphs from these ensembles. To take it one step further, a general approach using the eigenvalues of the adjacency matrix rather than just the number of short cycles will also be presented, [2].

[1] López, Fabián Aguirre, et al. "Exactly solvable random graph ensemble with extensively many short cycles." Journal of Physics A: Mathematical and Theoretical 51.8 (2018): 085101.
[2] López, Fabián Aguirre, and Anthony CC Coolen. "Imaginary replica analysis of loopy regular random graphs." Journal of Physics A: Mathematical and Theoretical 53.6 (2020): 065002.

The goal of this talk is to introduce a way to use the philosophy of Random Matrix Theory to understand, pose, and maybe even solve problems about p-adic matrices.

I will talk about my work arxiv:1911.05038. We prove the local-in-time well-posedness for the solution of the compressible Euler equations in $3$-D, for the Cauchy data of the velocity, density and vorticity $(v,\varrho, \omega) \in H^s\times H^s\times H^{s'}$, $2<s'<s$. The result extends the sharp result of Smith-Tataru and Wang, established in the irrotational case, i.e $ \omega=0$, which is known to be optimal for $s>2$. At the opposite extreme, in the incompressible case, i.e. with a constant density, the result is known to hold for $ \omega\in H^s$, $s>3/2$ and fails for $s\le 3/2$, see the work of Bourgain-Li. It is thus natural to conjecture that the optimal result should be $(v,\varrho, \omega) \in H^s\times H^s\times H^{s'}$, $s>2, \, s'>\frac{3}{2}$. We view our work here as an important step in proving the conjecture. The main difficulty in establishing sharp well-posedness results for general compressible Euler flow is due to the highly nontrivial interaction between the sound waves, governed by quasilinear wave equations, and vorticity which is transported by the flow. To overcome this difficulty, we separate the dispersive part of sound wave from the transported part, and gain regularity significantly by exploiting the nonlinear structure of the system and the geometric structures of the acoustic spacetime.
 

Given two metric spaces $X$ and $Y$, it is natural to ask how faithfully, from the point of view of the metric, one can embed $X$ into $Y$. One way of making this precise is asking whether there exists a coarse embedding of $X$ into $Y$. Positive results are plentiful and diverse, from Assouad's embedding theorem for doubling metric spaces to the elementary fact that any finitely generated subgroup of a finitely generated group is coarsely embedded with respect to word metrics. Moreover, the consequences of admitting a coarse embedding into a sufficiently nice space can be very strong. By contrast, there are few invariants which provide obstructions to coarse embeddings, leaving many seemingly elementary geometric questions open.
I will present new families of invariants which resolve some of these questions. Highlights of the talk include a new algebraic dichotomy for connected unimodular Lie groups, and a method of calculating a lower bound on the conformal dimension of a compact Ahlfors-regular metric space.
 

The optimal matching problem is about the rate of convergence
in Wasserstein distance of the empirical measure of iid uniform points
to the Lebesgue measure. We will start by reviewing the macroscopic
behaviour of the matching problem and will then report on recent results
on the mesoscopic behaviour in the thermodynamic regime. These results
rely on a quantitative large-scale linearization of the Monge-Ampere
equation through the Poisson equation. This is based on joint work with
Michael Goldman and Felix Otto.
 

We "review" how one can expand a filtration by continuously adding a stochastic process. The new results (obtained with Léo Neufcourt) relate to the seimartingale decompositions after the expansion. We give some possible applications.