Past

I will talk about some recent joint work with H. Bui and J. Keating where we study the Ratios Conjecture for the family of quadratic L-functions over function fields. I will also discuss the closely related problem of obtaining upper bounds for negative moments of L-functions, which allows us to obtain partial results towards the Ratios Conjecture in the case of one over one, two over two and three over three L-functions. 

Trophic coherence, a measure of a graph’s hierarchical organisation, has been shown to be linked to a graph’s structural and dynamical aspects such as cyclicity, stability and normality. Trophic levels of vertices can reveal their functional properties, partition and rank the vertices accordingly. Trophic levels and hence trophic coherence can only be defined on graphs with basal vertices, i.e. vertices with zero in-degree. Consequently, trophic analysis of graphs had been restricted until now. In this talk I will introduce a novel  framework which can be defined on any simple graph. Within this general framework, I'll illustrate several new metrics: hierarchical levels, a generalisation of the notion of trophic levels, influence centrality, a measure of a vertex’s ability to influence dynamics, and democracy coefficient, a measure of overall feedback in the system. I will then discuss what new insights are illuminated on the topological and dynamical aspects of graphs. Finally, I will show how the hierarchical structure of a network relates to the incidence rate in a SIS epidemic model and the economic insights we can gain through it.

Article link: https://www.nature.com/articles/s41598-021-93161-4

The $n$-queens problem asks how many ways there are to place $n$ queens on an $n \times n$ chessboard so that no two queens can attack one another, and the toroidal $n$-queens problem asks the same question where the board is considered on the surface of a torus. Let $Q(n)$ denote the number of $n$-queens configurations on the classical board and $T(n)$ the number of toroidal $n$-queens configurations. The toroidal problem was first studied in 1918 by Pólya who showed that $T(n)>0$ if and only if $n \equiv 1,5 \mod 6$. Much more recently Luria showed that $T(n)\leq ((1+o(1))ne^{-3})^n$ and conjectured equality when $n \equiv 1,5 \mod 6$. We prove this conjecture, prior to which no non-trivial lower bounds were known to hold for all (sufficiently large) $n \equiv 1,5 \mod 6$. We also show that $Q(n)\geq((1+o(1))ne^{-3})^n$ for all $n \in \mathbb{N}$ which was independently proved by Luria and Simkin and, combined with our toroidal result, completely settles a conjecture of Rivin, Vardi and Zimmerman regarding both $Q(n)$ and $T(n)$. 

In this talk we'll discuss our methods used to prove these results. A crucial element of this is translating the problem to one of counting matchings in a $4$-partite $4$-uniform hypergraph. Our strategy combines a random greedy algorithm to count `almost' configurations with a complex absorbing strategy that uses ideas from the methods of randomised algebraic construction and iterative absorption.

This is joint work with Peter Keevash.

A complex plane curve singularity gives rise to two objects: (1) a moduli space that representation theorists call an affine Springer fiber, and (2) a topological link up to isotopy. Roughly a decade ago, Oblomkov–Rasmussen–Shende conjectured a striking identity relating the homology of the affine Springer fiber to the so-called HOMFLYPT homology of the link. In unpublished writing, Shende speculated that it would follow from advances in nonabelian Hodge theory: the study of transcendental diffeomorphisms relating “Hitchin” and “Betti” moduli spaces. We make this dream precise by expressing HOMFLYPT homology in terms of the homology of a “Betti”-type space, which, we conjecture, deformation-retracts onto the affine Springer fiber. In doing so, we recast the whole story in terms of an arbitrary semisimple group. We give evidence for the nonabelian Hodge conjecture at the numerical level, using a mysterious formula that involves rational Cherednik algebras and the degrees of unipotent principal-series representations.

Michael Negus

Modelling high-speed droplet impact onto an elastic membrane

The impact of a high-speed droplet onto an elastic membrane is a highly nonlinear process and poses a formidable modelling challenge due to both the multi-scale nature of the flow and the fluid-structure interaction between the droplet and the membrane. We present two modelling approaches for droplet impact onto elastic membranes: matched asymptotics and direct numerical simulations (DNS). Inviscid Wagner theory is used in the former to derive analytical expressions which approximate the behaviour of the droplet during the early stages of impact, while the DNS builds on the open-source volume-of-fluid code Basilisk. We demonstrate the strong influence that the thickness, tension and stiffness of the membrane have on the dynamics of the droplet and the membrane. We also quantitatively show that the speed the droplet spreads across the substrate is notably decreased when the membrane is more compliant, which is consistent with experimental findings that splashing can be inhibited by impacting onto a soft substrate. We conclude by showing how these methods are complementary, as a combination of both can lead to a thorough understanding of the droplet impact across timescales.

Helen Saville

Lubrication model of a valve-controlled, gravity-driven bioreactor

Hospitals sometimes experience shortages of donor blood platelet supplies, motivating research into in vitro production of platelets. We model a novel platelet bioreactor described in Shepherd et al. [1]. The bioreactor consists of an upper channel, a lower channel, and a cell-seeded porous collagen scaffold situated between the two. Flow is driven by gravity, and controlled by valves on the four inlets and outlets. The bioreactor is long relative to its width, a feature which we exploit to derive a lubrication reduction of Navier-Stokes flow coupled to Darcy. Models for two cases are considered: small amplitude valve oscillations, and order one amplitude valve oscillations. The former model is a systematic reduction; the latter incorporates a phenomenological approximation for the cross-sectional flow profile. As the shear stress experienced by cells influences platelet production, we use our model to quantify the effect of valve dynamics on shear stress.

1: Shepherd, J.H., Howard, D., Waller, A.K., Foster, H.R., Mueller, A., Moreau, T., Evans, A.L., Arumugam, M., Chalon, G.B., Vriend, E. and Davidenko, N., Biomaterials, 182, pp.135-144. (2018)

It is a widely accepted philosophy in additive number theory that convex sets ought not to exhibit much additive structure. We could measure this by estimating the sizes of their sumsets. In this talk, we will hopefully move from the philosophical to the concrete, by giving ways to see that convex sets and functions have poor additive structure. We will also discuss some recent developments in the area.

We will report on recent progress regarding the near-critical behavior of certain statistical physics models in dimension 3. Our results deal with the second-order phase transition associated to two percolation problems involving the Gaussian free field in 3D. In one case, they determine a unique ``fixed point'' corresponding to the transition, which is proved to obey one of several scaling relations. Such laws are classically conjectured to hold by physicists on the grounds of a corresponding scaling ansatz. 

The aim of this talk is to understand the qualitative properties that emerge from a PDE model inspired from neurosciences, in order to understand what are the key processes that lead to mathematical complex patterns for the solutions of this equation. 

In a joint work with Peter Ozsvath we have developed algebraic invariants for knots using a family of bordered knot algebras. The goal of this lecture is to review these constructions and discuss some of the latest developments.

Cohomological Hall algebras and vertex algebras are two structures whose origins are (at least in part) from physics. I will explain what these objects are, how the latter was related to moduli stacks by Joyce, and a theorem relating these two structures. The main tool is torus localisation, a method for "turning geometry into combinatorics", or rather a new formulation of it which works in the singular setting.

We consider the problem of parameter estimation for a McKean stochastic differential equation, and the associated system of weakly interacting particles. The problem is motivated by many applications in areas such as neuroscience, social sciences (opinion dynamics, cooperative behaviours), financial mathematics, statistical physics. We will first survey some model properties related to propagation of chaos and ergodicity and then move on to discuss the problem of parameter estimation both in offline and on-line settings. In the on-line case, we propose an online estimator, which evolves according to a continuous-time stochastic gradient descent algorithm on the asymptotic log-likelihood of the interacting particle system. The talk will present our convergence results and then show some numerical results for two examples, a linear mean field model and a stochastic opinion dynamics model. This is joint work with Louis Sharrock, Panos Parpas and Greg Pavliotis. Preprint: https://arxiv.org/abs/2106.13751

The analytic structure of scattering amplitudes exhibit striking
properties that are not at all evident from the first principles of
Quantum Field Theory. These are often rich and powerful enough to be
considered as their defining features, and this makes the problem of
finding a set of universal rules a compelling one. I will review the
recently mounting evidence for the relevance of tropical Grassmannians
in this respect, including implications on symbol alphabets and
adjacency conditions

In this talk I will review the “holomorphic modular bootstrap,” i.e. the classification of rational conformal field theories via an analysis of the modular differential equations satisfied by their characters. By making use of the representation theory of PSL(2, Zn), we describe a method to classify allowed central charges and weights (c, hi) for theories with any number of characters d. This allows us to avoid various bottlenecks encountered previously in the literature, and leads to a classification of consistent characters up to d = 5 whose modular differential equations are uniquely fixed in terms of (c, hi). In the process, we identify the full set of constraints on the allowed values of the Wronskian index for fixed d ≤ 5.

This session will take place live in L1 only and not online on Teams. 

Are you interested in sharing your love of Maths with the next generation of mathematicians, but you don’t know where to start? In this session we will discuss some basic principles and top tips for creating a workshop for students aged 14–16, and get you started on developing your own. There will also be the opportunity to work on this further afterwards and potentially deliver your session as part of the Oxfordshire Maths Masterclasses (for local school students) in Hilary Term. Bring along your favourite bit of maths and a willingness to have a go.

In this talk, I'll present inequalities bounding the number of critical cells in a filtered cell complex on the one hand, and the entries of the Betti tables of the multi-parameter persistence modules of such filtrations on the other hand. Using the Mayer-Vietoris spectral sequence we first obtain strong and weak Morse inequalities involving the above quantities, and then we improve the weak inequalities achieving a sharp lower bound for the number of critical cells. Furthermore, we prove a sharp upper bound for the minimal number of critical cells, expressed again in terms of the entries of Betti tables. This is joint work with Andrea Guidolin (KTH, Stockholm). The full paper is posted online as arxiv:2108.11427.

The Specht modules are of fundamental importance to the representation theory of the symmetric group, and their 0th cohomology is understood through entirely combinatorial methods due to Gordon James. Over fields of odd characteristic, Hemmer proposed a similar combinatorial approach to calculating their 1st degree cohomology, or extensions by the trivial module. This combinatorial approach motivates the definition of universal $p$-ary designs, which we shall classify. We then explore the consequences of this classification to problem of determining extensions of Specht modules. In particular, we classify all extensions of Specht modules indexed by two-part partitions by the trivial module and shall see some far-reaching conditions on when the first cohomology of a Specht module is trivial.

This session is particularly aimed at fourth-year and OMMS students who are completing a dissertation this year. The talk will be given by Dr Richard Earl who chairs Projects Committee. For many of you this will be the first time you have written such an extended piece on mathematics. The talk will include advice on planning a timetable, managing the  workload, presenting mathematics, structuring the dissertation and creating a narrative, providing references and avoiding plagiarism.

TBC

Uncertainty Quantification through Markov Chain Monte Carlo (MCMC) can be prohibitively expensive for target probability densities with expensive likelihood functions, for instance when the evaluation it involves solving a Partial Differential Equation (PDE), as is the case in a wide range of engineering applications. Multilevel Delayed Acceptance (MLDA) with an Adaptive Error Model (AEM) is a novel approach, which alleviates this problem by exploiting a hierarchy of models, with increasing complexity and cost, and correcting the inexpensive models on-the-fly. The method has been integrated within the open-source probabilistic programming package PyMC3 and is available in the latest development version.

In this talk I will talk about the problems with the Multilevel Markov Chain Monte Carlo (Dodwell et al. 2015). In so we will prove detailed balance for Adaptive Multilevel Delayed Acceptance, as well as showing that multilevel variance reduction can be achieved without bias, not possible in the original MLMCMC framework.

I will talk about our implementation in the latest version of pymc3, and demonstrate how for classical inverse problem benchmarks the AMLDA sampler offers huge computational savings (> factor of 100 fold speed up).

Finally I will talk heuristically about new / future research, in which we seek to develop parallel strategies for this inherently sequential sampler, as well as point to interesting applied application areas in which the method is proving particular effective.

--

This talk will be in person.

The complexity of biological systems necessitates that we develop mathematical models to further our understanding of these systems. Mathematical models of these systems are generally based on heterogeneous sets of experimental data, resulting in a seemingly heterogeneous collection of models that ostensibly represent the same system. To understand the system, and to reveal underlying design principles, we therefore need to understand how the different models are related to each other with a view to obtaining a unified mathematical description. This goal is complicated by the number of distinct mathematical formalisms that may be employed to represent the same system, making direct comparison of the models very difficult. In this talk I will discuss two general methodologies, namely comparison by distance and comparison by equivalence, that allow us to compare model structures in a systematic way by representing models as labelled simplicial complexes. The distance can be obtained either directly from the simplicial complexes, or from the persistence intervals obtained by employing persistent homology with a flat filtration. Model equivalence is used to determine the conceptual similarity of models and can be automated by using group actions on the simplicial complexes. We apply our methodology for model comparison to demonstrate a particular equivalence between a positional-information model and a Turing-pattern model from developmental biology, which constitutes a novel observation for two classes of models that were previously regarded as unrelated. We also discuss an alternative framework for model comparison by representing models as groups, which allows for the application of group-theoretic techniques within our model comparison methodology.

In this talk, we describe some recent work on applying tools from category theory in finite model theory, descriptive complexity, constraint satisfaction, and combinatorics.

The motivations for this work come from Computer Science, but there may be something of interest for model theorists and other logicians.

The basic setting involves studying the category of relational structures via a resource-indexed family of adjunctions with some process category - which unfolds relational structures into treelike forms, allowing natural resource parameters to be assigned to these unfoldings.

One basic instance of this scheme allows us to recover, in a purely structural, syntax-free way:

- the Ehrenfeucht-Fraisse game

- the quantifier rank fragments of first-order logic

- the equivalences on structures induced by (i) the quantifier rank fragments, (ii) the restriction to the existential-positive part, and (iii) the extension with counting quantifiers

- the combinatorial parameter of tree-depth (Nesetril and Ossona de Mendez).

Another instance recovers the k-pebble game, the finite-variable fragments, the corresponding equivalences, and the combinatorial parameter of treewidth.

Other instances cover modal, guarded and hybrid fragments, generalized quantifiers, and a wide range of combinatorial parameters.

This whole scheme has been axiomatized in a very general setting, of arboreal categories and arboreal covers.

Beyond this basic level, a landscape is beginning to emerge, in which structural features of the resource categories, adjunctions and comonads are reflected in degrees of logical and computational tractability of the corresponding languages.

Examples include semantic characterisation and preservation theorems, Lovasz-type results on  isomorphisms, and classification of constraint satisfaction problems.