Past

Partial differential equations governing unknown or evolving geometries are ubiquitous in applications and challenging to discretize. A great deal of numerical work in this area has focused on extrinsic geometric flows, where the evolving geometry is a curve or surface embedded in Euclidean space. Much less attention has been paid to the discretization of intrinsic geometric flows, where the evolving geometry is described by a Riemannian metric. This talk will present finite element discretizations of such flows.
 

Combinatorial anabelian geometry is a modern branch of anabelian geometry which deals with those aspects of anabelian geometry which manifest themselves over algebraically closed fields of characteristic zero. The origin of combinatorial anabelian geometry is in S. Mochizuki’s pioneering papers from 2007, in which he reinterpreted and generalised some key components of his earlier famous proof of the Grothendieck conjecture. S. Mochizuki  discovered that one can separate arguments which work over algebraically closed fields from arithmetic arguments, and study the former by using combinatorial methods. This led to a very nontrivial development of the theory of combinatorial anabelian geometry by S. Mochizuki and Y. Hoshi and other mathematicians. In this talk, after introducing the theory of combinatorial anabelian geometry I will discuss  applications of combinatorial anabelian geometry to the study of the absolute Galois group of number fields and of p-adic local fields and to the study of the Grothendieck-Teichmueller group. In particular, I will talk about the recent construction of a splitting of the natural inclusion of the absolute Galois group of p-adic numbers to the (largest) p-adic Grothendieck–Teichmueller group and a splitting of the natural embedding of the absolute Galois group of rationals into the commensurator of the absolute Galois group of the maximal abelian extension of rationals in the Grothendieck–Teichmueller group.
 

Decision problems – those in which the goal is to return an answer of “YES" or “NO" – are at the heart of the theory of computational complexity, and remain the most studied problems in the theoretical algorithms community. However, in many real-world applications it is not enough just to decide whether the problem under consideration admits a solution: we often want to find all solutions, or at least count (either exactly or approximately) their  total number. It is clear that finding or counting all solutions is at least as computationally difficult as deciding whether there exists a single solution, and  indeed in many cases it is strictly harder (assuming P is not equal NP) even to count approximately the number of solutions than it is to decide whether there exists at least one.

In this talk I will discuss a restricted family of problems, in which we are interested in solutions of a given size: for example, solutions could be copies of a specific k-vertex graph H in a large host graph G, or more generally k-vertex subgraphs of G that have some specified property (e.g. k-vertex subgraphs that are connected). In this setting, although exact counting is strictly harder than decision (assuming standard assumptions in parameterised complexity), the methods typically used to separate approximate counting from decision break down. Indeed, I will demonstrate a method that, subject to certain additional assumptions, allows us to transform an efficient decision algorithm for a problem of this form into an approximate counting algorithm with essentially the same running time.

This is joint work with John Lapinskas (Bristol) and Holger Dell (ITU Copenhagen).

The two courses I took from Wilkinson as a graduate student at Stanford influenced me greatly.  Along with some reminiscences of those days, this talk will touch upon backward error analysis, Gaussian elimination, and Evariste Galois.  It was originally presented at the Wilkinson 100th Birthday conference in Manchester earlier this year.

Many soft materials, such as elastomers and hydrogels, are made of long chain molecules crosslinked to form a three-dimensional network. Their mechanical properties depend on network parameters such as chain density, chain length distribution and the functionality of the crosslinks. Understanding the relationships between the topology of polymer networks and their mechanical properties has been a long-standing challenge in polymer physics.

In this work, we focus on so-called “near-ideal” networks, which are produced by the cross-coupling of star-like macromolecules with well-defined chain length. We developed a computational approach based on random discrete networks, according to which the polymer network is represented by an assembly of non-linear springs connected at junction points representing crosslinks. The positions of the crosslink points are determined from the conditions of mechanical equilibrium. Scaling relations for the elastic modulus and maximum extensibility of the network were obtained. Our scaling relations contradict some predictions of classical estimates of rubber elasticity and have implications for the interpretation of experimental data for near-ideal polymer networks.

Reference: G. Alame, L. Brassart. Relative contributions of chain density and topology to the elasticity of two-dimensional polymer networks. Soft Matter 15, 5703 (2019).

Magnetic skyrmions are topological solitons which occur in a large class
of ferromagnetic materials and which are currently attracting much
attention in the condensed matter community because of  their possible
use  in future magnetic information storage technology.  The talk is
about an integrable model for magnetic skyrmions, introduced in a recent
paper (arxiv 1812.07268) and generalised in (arxiv 1905.06285). The
model can be solved by interpreting it as a gauged nonlinear sigma
model. In the talk will explain the model and the geometry behind its
integrability, and discuss some of the solutions and their physical
interpretation.

In 1941, Chabauty gave a way to compute the set of rational points on specific curves. In 2004, Minhyong Kim showed how to extend Chabauty's method to a bigger class of curves using anabelian methods. In the talk, I will explain Chabauty's method and give an outline of how Kim extended those methods.

Description:In his seminal work from the 1950s, William Feller classified all one-dimensional diffusions in terms of their ability to access the boundary (Feller's test for explosions) and to enter the interior from the boundary. Feller's technique is restricted to diffusion processes as the corresponding differential generators allow explicit computations and the use of Hille-Yosida theory. In the present article we study exit and entrance from infinity for jump diffusions driven by a stable process.Many results have been proved for jump diffusions, employing a variety of techniques developed after Feller's work but exit and entrance from infinite boundaries has long remained open. We show that the these processes have features not observes in the diffusion setting. We derive necessary and sufficient conditions on σ so that (i) non-exploding solutions exist and (ii) the corresponding transition semigroup extends to an entrance point at `infinity'. Our proofs are based on very recent developments for path transformations of stable processes via the Lamperti-Kiu representation and new Wiener-Hopf factorisations for Lévy processes that lie therein. The arguments draw together original and intricate applications of results using the Riesz-Bogdan--Żak transformation, entrance laws for self-similar Markov processes, perpetual integrals of Lévy processes and fluctuation theory, which have not been used before in the SDE setting, thereby allowing us to employ classical theory such as Hunt-Nagasawa duality and Getoor's characterisation of transience and recurrence.

I will give a brief survey of some problems in curvature free geometry and sketch

a new proof of the following:

Theorem (Guth). There is some $\delta (n)>0$ such that if $(M^n,g)$ is a closed aspherical Riemannian manifold and $V(R)$ is the volume of the largest ball of radius $R$ in the universal cover of $M$, then $V(R)\geq \delta(n)R^n$ for all $R$.

I will also discuss some recent related questions and results.

Backward Stochastic Differential Equations (BSDEs) have been successfully applied  to represent the value of optimal control problems for controlled

stochastic differential equations. Since in the classical framework several restrictions on the scope of applicability of this method remained, in recent times several approaches have been devised to obtain the desired probabilistic representation in more general situations. We will review the so called  randomization method, originally introduced by B. Bouchard in the framework of optimal switching problems, which consists in introducing an auxiliary,`randomized'' problem with the same value as the original one, where the control process is replaced by an exogenous random point process,and optimization is performed over a family of equivalent probability measures. The value of the randomized problem is then represented

by means of a special class of BSDEs with a constraint on one of the unknown processes.This methodology will be applied in the framework of controlled evolution equations (with immediate applications to controlled SPDEs), a case for which very few results are known so far.

The Weak Gravity Conjecture holds that in any consistent theory of quantum gravity, gravity must be the weakest force. This simple proposition has surprisingly nontrivial physical consequences, which in the case of supersymmetric string/M-theory compactifications lead to nontrivial geometric consequences for Calabi-Yau manifolds. In this talk we will describe these conjectured geometric consequences in detail and show how they are realized in concrete examples, deriving new results about 5d supersymmetric black holes in the process.

The classical Universal Approximation Theorem certifies that the universal approximation property holds for the class of neural networks of arbitrary width. Here we consider the natural `dual' theorem for width-bounded networks of arbitrary depth, for a broad class of activation functions. In particular we show that such a result holds for polynomial activation functions, making this genuinely different to the classical case. We will then discuss some natural extensions of this result, e.g. for nowhere differentiable activation functions, or for noncompact domains.
 

Tensors are higher dimensional analogues of matrices; they are used to record data with multiple changing variables. Interpreting tensor data requires finding low rank structure, and the structure depends on the application or context. Often tensors of interest define semi-algebraic sets, given by polynomial equations and inequalities. I'll give a characterization of the set of tensors of real rank two, and answer questions about statistical models using probability tensors and semi-algebraic statistics. I will also describe work on learning a path from its three-dimensional signature tensor. This talk is based on joint work with Guido Montúfar, Max Pfeffer, and Bernd Sturmfels.

We study nearly singular PDEs that arise in the solution of linear elasticity and incompressible flow. We will demonstrate, that due to the nearly singular nature, standard methods for the solution of the linear systems arising in a finite element discretisation for these problems fail. We motivate two key ingredients required for a robust multigrid scheme for these equations and construct robust relaxation and prolongation operators for a particular choice of discretisation.
 

Numerous researchers recently applied empirical spectral analysis to the study of modern deep learning classifiers. We identify and discuss an important formal class/cross-class structure and show how it lies at the origin of the many visually striking features observed in deepnet spectra, some of which were reported in recent articles and others unveiled here for the first time. These include spectral outliers and small but distinct bumps often seen beyond the edge of a "main bulk". The structure we identify organizes the coordinates of deepnet features and back-propagated errors, indexing them as an NxC or NxCxC array. Such arrays can be indexed by a two-tuple (i,c) or a three-tuple (i,c,c'), where i runs across the indices of the train set; c runs across the class indices and c' runs across the cross-class indices. This indexing naturally induces C class means, each obtained by averaging over the indices i and c' for a fixed class c. The same indexing also naturally defines C^2 cross-class means, each obtained by averaging over the index i for a fixed class c and a cross-class c'. We develop a formal process of spectral attribution, which is used to show the outliers are attributable to the C class means; the small bump next to the "main bulk" is attributable to between-cross-class covariance; and the "main bulk" is attributable to within-cross-class covariance. Formal theoretical results validate our attribution methodology.
We show how the effects of the class/cross-class structure permeate not only the spectra of deepnet features and backpropagated errors, but also the gradients, Fisher Information matrix and Hessian, whether these are considered in the context of an individual layer or the concatenation of them all. The Kronecker or Khatri-Rao product of the class means in the features and the class/cross-class means in the backpropagated errors approximates the class/cross-class means in the gradients. These means of gradients then create C and C^2 outliers in the spectrum of the Fisher Information matrix, which is the second moment of these gradients. The outliers in the Fisher Information matrix spectrum then create outliers in the Hessian spectrum. We explain the significance of this insight by proposing a correction to KFAC, a well known second-order optimization algorithm for training deepnets.

The relationship between the large-scale geometry of a group and its algebraic structure can be studied via three notions: a group's quasi-isometry class, a group's abstract commensurability class, and geometric actions on proper geodesic metric spaces. A common model geometry for groups G and G' is a proper geodesic metric space on which G and G' act geometrically. A group G is action rigid if every group G' that has a common model geometry with G is abstractly commensurable to G. For example, a closed hyperbolic n-manifold group is not action rigid for all n at least three. In contrast, we show that free products of closed hyperbolic manifold groups are action rigid. Consequently, we obtain the first examples of Gromov hyperbolic groups that are quasi-isometric but do not virtually have a common model geometry. This is joint work with Daniel Woodhouse.

In 1985, McDowell introduced a family of parabolically induced Whittaker modules over a complex semisimple Lie algebra, which includes both Verma modules and the nondegenerate Whittaker modules studied by Kostant. Many classical results for Verma modules and the Bernstein--Gelfand--Gelfand category O have been generalized to the category of Whittaker modules introduced by Milicic--Soergel, including the classification of irreducible objects and the Kazhdan--Lusztig conjectures. Contravariant forms on Verma modules are unique up to scaling and play a key role in the definition of the Jantzen filtration. In this talk I will discuss a classification of contravariant forms on parabolically induced Whittaker modules. In a recent result, joint with Anna Romanov, we show that the dimension of the space of contravariant forms on a parabolically induced Whittaker module is given by the cardinality of a Weyl group. This result illustrates a divergence from classical results for Verma modules, and gives insight to two significant open problems in the theory of Whittaker modules: the Jantzen conjecture and the absence of an algebraic definition of duality.

In an increasingly urbanized world, where cities are changing continuously, it is essential for policy makers to have access to regularly updated decision-making tools for an effective management of urban areas. An example of these tools is the delineation of cities into functional areas which provides knowledge on high spatial interaction zones and their socioeconomic composition. In this paper, we presented a method for the structural analysis of a city, specifically for the determination of its functional areas, based on communities detection in graphs. The nodes of the graph correspond to geographical units resulting from a cartographic division of the city according to the road network. The edges are weighted using a Gaussian distance-decay function and the amount of spatial interactions between nodes. Our approach optimize the modularity to ensure that the functional areas detected have strong interactions within their borders but lower interactions outside. Moreover, it leverages on POIs' entropy to maintain a good socioeconomic heterogeneity in the detected areas. We conducted experiments using taxi trips and POIs datasets from the city of Porto, as a study case. Trough those experiments, we demonstrate the ability of our method to portray functional areas while including spatial and socioeconomic dynamics.
 

Here is the scientific program.

Keynote speakers:

Roger Kamm, Cecil and Ida Green Distinguished Professor of Biological and Mechanical Engineering, MIT

Alicia El Haj,  Interdisciplinary Chair of Cell Engineering, Healthcare Technology Institute, University of Birmingham

Invited speakers (confirmed to date):

Davide Ambrosi, Politecnico di Torino, Italy

Anthony Callanan, University of Edinburgh, UK

Ruth Cameron, University of Cambridge, UK

Sonia Contera, University of Oxford, UK

Linda Cummings, New Jersey Institute of Technology, USA

Mohit Dalwadi, University of Oxford, UK

John Dunlop, University of Salzburg, Austria

John King, Nottingham, UK

Nati Korin, Technion, Israel

Catriona Lally, Trinity College Dublin, Ireland

Sandra Loerakker, TU Eindhoven, Netherlands

Ivan Martin, University of Basel, Switzerland

Scott McCue, Queensland University of Technology, Australia

Pierre-Alexis Mouthuy, University of Oxford, UK

Tom Mullin,  University of Oxford, UK

Ramin Nasehi, Politecnico di Milano, Italy

Reuben O'Dea, University of Nottingham, UK

James Oliver, University of Oxford, UK

Ioannis Papantoniou, KU Leuven, Belgium

Ansgar Petersen, Julius Wolf Institute Berlin, Germany

Luigi Preziosi, Politecnico di Torino, Italy

Rebecca Shipley, University College London, UK

Barbara Wagner, Weierstrass Institute for Applied Analysis and Stochastics, Berlin

Cathy Ye, Oxford University, UK

Feihu Zhao, TU Eindhoven, Netherlands

This meeting is being held in celebration of Prof Philip Maini's 60th birthday. Prof Maini has been an internationally leading researcher in mathematical biology for decades. He is currently the Director of the Wolfson Centre for Mathematical Biology, a position he has held since 1998. In the past 20 years he has grown the group significantly. He has established countless interdisciplinary collaborations, has over 400 publications in numerous areas of mathematical biology, with major contributions in mathematical modelling of tumours, wound healing and embryonic pattern formation. He has been elected Fellow of the Royal Society (FRS), Fellow of the Academy of Medical Sciences (FMedSci), and Foreign Fellow of the Indian National Science Academy (FNA). He has served or is serving on editorial board of a large number of journals, and was Editor-in-Chief of the Bulletin of Mathematical Biology [2002-15]. And yet his service to the community cannot be captured just by numbers and titles. Anyone who has met him and worked with him cannot but notice and be touched by his unfailing generosity and the many sacrifices he has made and continues to make day in and day out to help students, early career researchers, and fellow faculty alike.

This meeting provides an opportunity to celebrate Prof Maini's many accomplishments; to thank him for all of his sacrifices; and to bring together the large number of researchers – mathematicians, biologists, physiologists, and clinicians – that he has worked with and interacted with over the years. More broadly, the meeting provides a unique opportunity to reflect on mathematical biology, to provide perspectives on the trajectory of a field that was scarcely recognised and had very few dedicated researchers in the days of Prof Maini's own DPhil; yet a field that has grown tremendously since then. Much of this growth is attributable to the work of Prof Maini, so that today the value of mathematics in biology is increasingly recognized by biologists and clinicians, and with theoretical predictions of mathematical models having cemented a role in advancing biological understanding. 

Speakers

David Sumpter, Uppsala University (Public lecture), Derek Moulton, University of Oxford, Hans Othmer, Minnesota University, Jen Flegg, University of Melbourne, Jim Murray, University of Washington, Jonathan Sherratt, Heriot-Watt University, Kevin Painter, Heriot-Watt University, Linus Schumacher, University of Edinburgh, Lucy Hutchinson, Roche, Mark Chaplain, University of St Andrews, Mark Lewis, University of Alberta, Mary Myerscough, University of Sydney, Natasha Martin, University of Bristol, Noemi Picco, Swansea University, Paul Kulesa, Stowers Institute for Medical Research, Ruth Baker, University of Oxford, Santiago Schnell, University of Michigan, Tim Pedley, University of Cambridge

Organising committee

Ruth Baker (University of Oxford)

Derek Moulton (University of Oxford)

Helen Byrne (University of Oxford)

Santiago Schnell (University of Michigan)

Mark Chaplain (University of St Andrews)

The analysis and characterization of human mobility using population-level mobility models is important for numerous applications, ranging from the estimation of commuter flows to modeling trade flows. However, almost all of these applications have focused on large spatial scales, typically from intra-city level to inter-country level. In this paper, we investigate population-level human mobility models on a much smaller spatial scale by using them to estimate customer mobility flow between supermarket zones. We use anonymized mobility data of customers in supermarkets to calibrate our models and apply variants of the gravity and intervening-opportunities models to fit this mobility flow and estimate the flow on unseen data. We find that a doubly-constrained gravity model can successfully estimate 65-70% of the flow inside supermarkets. We then investigate how to reduce congestion in supermarkets by combining mobility models with queueing networks. We use a simulated-annealing algorithm to find store layouts with lower congestion than the original layout. Our research gives insight both into how customers move in supermarkets and into how retailers can arrange stores to reduce congestion. It also provides a case study of human mobility on small spatial scales.