Past

Would you employ you? What are employers looking for in Mathematical graduates? What kind of work can use your skills? This workshop will get your minds thinking about the possibilities after you have finished studying and will cover:

·         General careers’ information starting from a mathematical sciences degree

·         Things to think about at CV and interview stage

·         How membership of a professional body (the IMA) supports your applications and career development.

·         Information about the Mathematics Teacher Training Scholarships

Here Z is Zermelo’s set theory of 1908, as later formulated: full separation, but no replacement or collection among its axioms. PROVI was presented in lectures in Cambridge in 2010 and later published with improvements by Nathan Bowler, and is, I claim, the weakest subsystem of ZF to support a recognisable theory of set forcing: PROV is PROVI shorn of its axiom of infinity. The provident sets are the transitive non-empty models of PROV. The talk will begin with a presentation of PROV, and then discuss more recent applications and problems: in particular an answer in the system Z + PROV to a question posed by Eugene Wesley in 1972 will be sketched, and two proofs (fallacious, I hope) of 0 = 1 will be given, one using my slim models of Z and the other applying the Spector–Gandy theorem to certain models of PROVI. These “proofs”, when re-interpreted, supply some arguments of Reverse Mathematics.

Given a "random" polynomial over the integers, it is expected that, with high probability, it is irreducible and has a big Galois group over the rationals. Such results have been long known when the degree is bounded and the coefficients are chosen uniformly at random from some interval, but the case of bounded coefficients and unbounded degree remained open. Very recently, Emmanuel Breuillard and Peter Varju settled the case of bounded coefficients conditionally on the Riemann Hypothesis for certain Dedekind zeta functions. In this talk, I will present unconditional progress towards this problem, joint with Lior Bary-Soroker and Gady Kozma.

Many fluid flows in natural systems are highly complex, with an often beguilingly intricate and confusing detailed structure. Yet, as with many systems, a good deal of insight can be gained by testing the consequences of simple mathematical models that capture the essential physics.  We’ll tour two such problems.  In the summer melt seasons in Greenland, lakes form on the surface of the ice which have been observed to rapidly drain.  The propagation of the meltwater in the subsurface couples the elastic deformation of the ice and, crucially, the flow of water within the deformable subglacial till.  In this case the poroelastic deformation of the till plays a subtle, but crucial, role in routing the surface meltwater which spreads indefinitely, and has implications for how we think about large-scale motion in groundwater aquifers or geological carbon storage.  In contrast, when magma erupts onto the Earth’s surface it flows before rapidly cooling and crystallising.  Using analogies from the kitchen we construct, and experimentally test, a simple model of what sets the ultimate extent of magmatic intrusions on Earth and, as it turns out, on Venus.  The results are delicious!  In both these cases, we see how a simplified mathematical analysis provides insight into large scale phenomena.

Since differentiation generally lowers exponents, it is straightforward that the space of Laurent polynomials $\mathbb{C}[x, x^{-1}]$ is a finitely generated module over the ring of differential operators $\mathbb{C}[x, \mathrm{d}/\mathrm{d}x]$. This innocent looking fact has been vastly generalized to a statement about holonomic D-modules, using the beautiful theory of b-functions (or Bernstein—Sato polynomials). I will give an overview of the classical theory before discussing some recent developments concerning a $p$-adic analytic analogue, which is joint work with Thomas Bitoun.

When the linear system in Newton’s method is approximately solved using an iterative method we have an inexact or truncated Newton method. The outer method is Newton’s method and the inner iterations will be the iterative method. The Inexact Newton framework is now close to 30 years old and is widely used and given names like Newton-Arnoldi, Newton-CG depending on the inner iterative method. In this talk we will explore convergence properties when the outer iterative method is Gauss-Newton, the Halley method or an interior point method for linear programming problems.

In this talk, which is based on joint work with Benjamin Gess, I will describe a pathwise well-posedness theory for stochastic porous media and fast diffusion equations driven by nonlinear, conservative noise. Such equations arise in the theory of mean field games, as an approximation to the Dean–Kawasaki equation in fluctuating hydrodynamics, to describe the fluctuating hydrodynamics of a zero range process, and as a model for the evolution of a thin film in the regime of negligible surface tension.  Our methods are motivated by the theory of stochastic viscosity solutions, which are applied after passing to the equation’s kinetic formulation, for which the noise enters linearly and can be inverted using the theory of rough paths.  I will also mention the application of these methods to nonlinear diffusion equations with linear, multiplicative noise.

When groups may be built up as graphs of 'simpler' groups, it is often 
of interest to study how good residual finiteness properties of simpler 
groups can imply residual properties of the whole. The essential case of 
this theory is the study of residual properties of finite groups. In 
this talk I will discuss the question of when a graph of finite 
$p$-groups is residually $p$-finite, for $p$ a prime. I describe the 
previous theorems in this area for one-edge and finite graphs of groups, 
and their method of proof. I will then state my recent generalisation of 
these theorems to potentially infinite graphs of groups, together with 
an alternative and more natural method of proof. Finally I will briefly 
describe a usage of these results in the study of accessibility -- 
namely the existence of a finitely generated inaccessible group which is 
residually $p$-finite.

The Helmholtz equation models waves propagating with a fixed frequency. Discretising the Helmholtz equation for high frequencies via standard finite-elements results in linear systems that are large, non-Hermitian, and indefinite. Therefore, when solving these linear systems, one uses preconditioned iterative methods. When one considers uncertainty quantification for the Helmholtz equation, one will typically need to solve many (thousands) of linear systems corresponding to different realisations of the coefficients. At face value, this will require the computation of many preconditioners, a potentially expensive task.

Therefore, we investigate how well a preconditioner for one realisation of the Helmholtz equation works as a preconditioner for another realisation. We prove that if the two realisations are 'nearby' (with a precise meaning of 'nearby'), then the preconditioner is robust (that is, preconditioned GMRES converges in a number of iterations that is independent of frequency). We also give some preliminary computational results indicating the speedup one obtains in uncertainty quantification calculations.

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree \Delta is rapidly mixing for k \ge \Delta+2. In 1999, Vigoda showed rapid mixing of flip dynamics with certain flip parameters on the set of proper k-colorings for k > (11/6)\Delta, implying rapid mixing for Glauber dynamics. In this paper, we obtain the first improvement beyond the (11/6)\Delta barrier for general graphs by showing rapid mixing for k > (11/6 - \eta)\Delta for some positive constant \eta. The key to our proof is combining path coupling with a new kind of metric that incorporates a count of the extremal configurations of the chain. Additionally, our results extend to list coloring, a widely studied generalization of coloring. Combined, these results answer two open questions from Frieze and Vigoda’s 2007 survey paper on Glauber dynamics for colorings. 

This is joint work with Michelle Delcourt and Luke Postle.

The focus of this talk is how to tackle huge linear least square problems via sketching, a dimensionality reduction technique from randomised numerical linear algebra. The technique allows us to project the huge problem to a smaller dimension that captures essential information of the original problem. We can then solve the projected problem directly to obtain a low accuracy solution or using the projected problem to construct a preconditioner for the original problem to obtain a high accuracy solution. I will survey the existing projection techniques and evaluate the performance of sketching for linear least square problems by comparing it to the state-of-the-art traditional solution methods. More than ten-fold speed-up has been observed in some cases.

There have been two main attempts so far to forecast the level of development of artificial intelligence (or ‘computerisation’) over time, Frey and Osborne (2013, 2017) and Manyika et al (2017). Unfortunately, their methodology seems to be flawed. Their results depend upon expert predictions of which occupations will be automatable in 2050, but these predictions are notoriously unreliable. Therefore, we develop an alternative which does not depend upon these expert predictions. We build a dataset of all the start-ups, firms, and university research laboratories working on automating different types of tasks, and use this to build a dynamic network model of them and how they interact. How automatable each type of task is ‘emerges’ from the model. We validate it, predicting the level of development of supervised learning in 2017 using data from the year 2000, and use it to forecast of the automatability of each of these task types from 2018 to 2050. Finally, we discuss extensions for our model; how it could be used to test the impact of public policy decisions or forecast developments in other high-technology industries.

Progress in developing a consistent theory that describes physical phenomena
at scales where quantum and general relativistic effects are large is
hindered by the lack of experiments. In this talk, we present a proposal
that would overcome this experimental obstacle by using a Bose-Einstein
condensate (BEC) to test for possible conflicts between quantum theory and
general relativity. Recent developments in large BEC systems allows us to
verify if gravitationally-induced wave function collapse occurs at the
timescales predicted by Roger Penrose. BECs with high particle numbers
(N>10^9) can also be used to demonstrate quantum field theory in curved
spacetime by observing how changes in the spacetime affect the phononic
quantum field of a BEC. These effects will enable the development of a new
generation of instruments that will be able to probe scales where new
physics might emerge, with applications including gravitational wave
detectors, gravimeters, gradiometers and dark energy probes.

Abstract: We use groupoids to describe a geometric framework which can host a generalisation of Hairer's regularity structures to manifolds. In this setup, Hairer's re-expansionmap (usually denoted \Gamma) is a (direct) connection on a gauge groupoid and can therefore be viewed as a groupoid counterpart of a (local) gauge field. This definitions enables us to make the link between re-expansion maps (direct connections), principal connections and path connections, to understand the flatness of the direct connection in terms of that of the manifold and, finally, to easily build a polynomial regularity structure which we compare to the one given by Driver, Diehl and Dahlquist. (Join work with Sara Azzali, Alessandra Frabetti and Sylvie Paycha).

Quantum Yang-Mills theory is an important part of the Standard model built by physicists to describe elementary particles and their interactions. One approach to the mathematical substance of this theory consists in constructing a probability measure on an infinite-dimensional space of connections on a principal bundle over space-time. However, in the physically realistic 4-dimensional situation, the construction of this measure is still an open mathematical problem. The subject of this talk will be the physically less realistic 2-dimensional situation, in which the construction of the measure is possible, and fairly well understood.

In probabilistic terms, the 2-dimensional Yang-Mills measure is the distribution of a stochastic process with values in a compact Lie group (for example the unitary group U(N)) indexed by the set of continuous closed curves with finite length on a compact surface (for example a disk, a sphere or a torus) on which one can measure areas. It can be seen as a Brownian motion (or a Brownian bridge) on the chosen compact Lie group indexed by closed curves, the role of time being played in a sense by area.

In this talk, I will describe the physical context in which the Yang-Mills measure is constructed, and describe it without assuming any prior familiarity with the subject. I will then present a set of results obtained in the last few years by Antoine Dahlqvist, Bruce Driver, Franck Gabriel, Brian Hall, Todd Kemp, James Norris and myself concerning the limit as N tends to infinity of the Yang-Mills measure constructed with the unitary group U(N). 

 

After discussing a general excision technique for constructing canonical orientations for moduli spaces that derive from an elliptic equation, I shall
explain how to carry out this program in the case of G2-instantons and the 7-dimensional real Dirac operator. In many ways our approach can
be regarded as a categorification of the Atiyah-Singer index theorem. (Based on joint work with Dominic Joyce.)