Cohomology of Varieties
Abstract
We outline what we expect from a good cohomology theory and introduce some of the most common cohomology theories. We go on to discuss what properties each should encode and detail attempts to fit them into a common framework. We build evidence for this viewpoint through several worked number theoretic examples and explain how many of the key conjectures in number theory fit into this theory of motives.
Stable surfaces with constant mean curvature in 3-manifolds admitting a Killing vector field
Abstract
In this talk we will discuss some properties of Schrödinger operators on parabolic manifolds, and particularize them to study the stability operator of a parabolic surface with constant mean curvature immersed in a 3-manifold that admits a Killing vector field. As an application, we will determine the range of values of H such that some homogeneous 3-manifolds admit complete parabolic stable surfaces with constant mean curvature H. Time permitting, we will also discuss some related area and first-eigenvalue estimates for the stability operator of constant mean curvature graphs in such 3-manifolds.
Multi-scale analysis of wave propagation and imaging in random
Abstract
Wave propagation in random media can be studied by multi-scale and stochastic analysis. We first consider the direct problem and show that, in a physically relevant regime of separation of scales, wave propagation is governed by a Schrodinger-type equation driven by a Brownian field. We study the associated moment equations and clarify the propagation of coherent and incoherent waves. Second, using these new results we design original methods for sensor array imaging when the medium is randomly scattering and apply them to seismic imaging and ultrasonic testing of concrete.
Scaling limits for randomly trapped random walks
Abstract
A randomly trapped random walk on a graph is a simple continuous time random walk in which the holding time at a given vertex is an independent sample from a probability measure determined by the trapping landscape, a collection of probability measures indexed by the vertices.
This is a time change of the simple random walk. For the constant speed continuous time random walk, the landscape has an exponential distribution with rate 1 at each vertex. For the Bouchaud trap model it has an exponential random variable at each vertex but where the rate for the exponential is chosen from a heavy tailed distribution. In one dimension the possible scaling limits are time changes of Brownian motion and include the fractional kinetics process and the Fontes-Isopi-Newman (FIN) singular diffusion. We extend this analysis to put these models in the setting of resistance forms, a framework that includes finitely ramified fractals. In particular we will construct a FIN diffusion as the limit of the Bouchaud trap model and the random conductance model on fractal graphs. We will establish heat kernel estimates for the FIN diffusion extending what is known even in the one-dimensional case.
Quivers, Dessins and Calabi-Yau
Abstract
We discuss how bipartite graphs on Riemann surfaces encapture a wealth of information about the physics and the mathematics of gauge theories. The
correspondence between the gauge theory, the underlying algebraic geometry of its space of vacua, the combinatorics of dimers and toric varieties, as
well as the number theory of dessin d'enfants becomes particularly intricate under this light.
Automorphic String Amplitudes
Abstract
Automorphic forms arise naturally when studying scattering amplitudes in toroidal compactifications of string theory. In this talk, I will summarize the conditions on four-graviton amplitudes from the literature required by U-duality, supersymmetry and string perturbation theory, which are satisfied by certain Eisenstein series on exceptional Lie groups. Physical information, such as instanton effects, are encoded in their Fourier coefficients on parabolic subgroups, which are, in general, difficult to compute. I will demonstrate a method for evaluating certain Fourier coefficients of interest in string theory. Based on arXiv:1511.04265, arXiv:1412.5625 and work in progress.
16:00
Mathematics and Auction Design
Abstract
Mathematical methods are increasingly being used to design auctions. Paul Klemperer will talk about some of his own experience which includes designing the U.K.'s mobile phone licence auction that raised £22.5 billion, and a new auction that helped the Bank of England in the financial crisis. (The then-Governor, Mervyn King, described it as "a marvellous application of theoretical economics to a practical problem of vital importance".) He will also discuss further development of the latter auction using convex and "tropical" geometric methods.
14:15
Moffatt eddies in valleys beneath ice sheets
Abstract
Radar data from both Greenland and Antarctica show folds and other disruptions to the stratigraphy of the deep ice. The mechanisms by which stratigraphy deforms are related to the interplay between ice flow and topography. Here we show that when ice flows across valleys or overdeepenings, viscous overturnings called Moffatt eddies can develop. At the base of a subglacial valley, the shear on the valley walls is transfered through the ice, forcing the ice to overturn. To understand the formation of these eddies, we numerically solve the non-Newtonian Stokes equations with a Glen's law rheology to determine the critical valley angle for the eddies to form. The decrease in ice viscosity with shear enhances shear localization and, therefore, Moffatt eddies form in smaller valley angles (steeper slopes) than in a fluid that does not localize shear, such as a Newtonian fluid. When temperature is incorporated into the ice rheology, the warmer basal ice is less viscous and eddies form in larger valley angles (shallower slopes) than in isothermal ice. We apply our simulations to the Gamburtsev Subglacial Mountains and solve for the ice flow over radar-determined topography. These simulations show Moffatt eddies on the order of 100 meters tall in the deep subglacial valleys.
Uncovering biological computation in embryonic stem cells
Dr Sara-Jane Dunn - Microsoft Research Limited Cambridge, title tba
Pointwise Arbitrage Pricing Theory in Discrete Time
Abstract
We pursue robust approach to pricing and hedging in mathematical
finance. We develop a general discrete time setting in which some
underlying assets and options are available for dynamic trading and a
further set of European options, possibly with varying maturities, is
available for static trading. We include in our setup modelling beliefs by
allowing to specify a set of paths to be considered, e.g.
super-replication of a contingent claim is required only for paths falling
in the given set. Our framework thus interpolates between
model-independent and model-specific settings and allows to quantify the
impact of making assumptions. We establish suitable FTAP and
Pricing-Hedging duality results which include as special cases previous
results of Acciaio et al. (2013), Burzoni et al. (2016) as well the
Dalang-Morton-Willinger theorem. Finally, we explain how to treat further
problems, such as insider trading (information quantification) or American
options pricing.
Based on joint works with Burzoni, Frittelli, Hou, Maggis; Aksamit, Deng and Tan.
Two topics: signals in copper wires, Integrated Information Theory for organisational consciousness
17:30
Existentially definable henselian valuation rings with p-adic residue fields
Abstract
In joint work with Sylvy Anscombe we had found an abstract
valuation theoretic condition characterizing those fields F for which
the power series ring F[[t]] is existentially 0-definable in its
quotient field F((t)). In this talk I will report on recent joint work
with Sylvy Anscombe and Philip Dittmann in which the study of this
condition leads us to some beautiful results on the border of number
theory and model theory. In particular, I will suggest and apply a
p-adic analogue of Lagrange's Four Squares Theorem.
The Loop Theorem of Papakyriakopoulos
Abstract
The study of 3-manifolds is founded on the strong connection between algebra and topology in dimension three. In particular, the sine qua non of much of the theory is the Loop Theorem, stating that for any embedding of a surface into a 3-manifold, a failure to be injective on the fundamental group is realised by some genuine embedding of a disc. I will discuss this theorem and give a proof of it.
Flux-dependent graphs for metabolic networks
Abstract
Cells adapt their metabolic state in response to changes in the environment. I will present a systematic framework for the construction of flux graphs to represent organism-wide metabolic networks. These graphs encode the directionality of metabolic fluxes via links that represent the flow of metabolites from source to target reactions. The weights of the links have a precise interpretation in terms of probabilities or metabolite flow per unit time. The methodology can be applied both in the absence of a specific biological context, or tailored to different environmental conditions by incorporating flux distributions computed from constraint-based modelling (e.g., Flux-Balance Analysis). I will illustrate the approach on the central carbon metabolism of Escherichia coli, revealing drastic changes in the topological and community structure of the metabolic graphs, which capture the re-routing of metabolic fluxes under each growth condition.
By integrating Flux Balance Analysis and tools from network science, our framework allows for the interrogation of environment-specific metabolic responses beyond fixed, standard pathway descriptions.
CANCELED: Wach modules, regulator maps, and ε-isomorphisms in families
Abstract
In this talk on joint work with REBECCA BELLOVIN we discuss the “local ε-isomorphism” conjecture of Fukaya and Kato for (crystalline) families of G_{Q_p}-representations. This can be regarded as a local analogue of the global Iwasawa main conjecture for families, extending earlier work of Kato for rank one modules, of Benois and Berger for crystalline representations with respect to the cyclotomic extension as well as of Loeffler, Venjakob and Zerbes for crystalline representations with respect to abelian p-adic Lie extensions of Q_p. Nakamura has shown Kato’s - conjecture for (ϕ,\Gamma)-modules over the Robba ring, which means in particular only after inverting p, for rank one and trianguline families. The main ingredient of (the integrality part of) the proof consists of the construction of families of Wach modules generalizing work of Wach and Berger and following Kisin’s approach via a corresponding moduli space.
14:00
A Ringel duality formula inspired by Knörrer equivalences for 2d cyclic quotient singularities
Abstract
We construct triangle equivalences between singularity categories of
two-dimensional cyclic quotient singularities and singularity categories of
a new class of finite dimensional local algebras, which we call Knörrer
invariant algebras. In the hypersurface case, we recover a special case of Knörrer’s equivalence for (stable) categories of matrix factorisations.
We’ll then explain how this led us to study Ringel duality for
certain (ultra strongly) quasi-hereditary algebras.
This is based on joint work with Joe Karmazyn.
New challenges in the numerical solution of large-scale inverse problems
Abstract
Inverse problems are ubiquitous in many areas of Science and Engineering and, once discretised, they lead to ill-conditioned linear systems, often of huge dimensions: regularisation consists in replacing the original system by a nearby problem with better numerical properties, in order to find meaningful approximations of its solution. In this talk we will explore the regularisation properties of many iterative methods based on Krylov subspaces. After surveying some basic methods such as CGLS and GMRES, innovative approaches based on flexible variants of CGLS and GMRES will be presented, in order to efficiently enforce nonnegativity and sparsity into the solution.
12:00
Patlak-Keller-Segel equations
Abstract
Patlak-Keller-Segel equations
\[
\begin{aligned}
u_t - L u &= - \mathop{\text{div}\,} (u \nabla v) \\
v_t - \Delta v &= u,
\end{aligned}
\]
where L is a dissipative operator, stem from mathematical chemistry and mathematical biology.
Their variants describe, among others, behaviour of chemotactic populations, including feeding strategies of zooplankton or of certain insects. Analytically, Patlak-Keller-Segel equations reveal quite rich dynamics and a delicate global smoothness vs. blowup dichotomy.
We will discuss smoothness/blowup results for popular variants of the equations, focusing on the critical cases, where dissipative and aggregative forces seem to be in a balance. A part of this talk is based on joint results with Rafael Granero-Belinchon (Lyon).
15:45
14:30
Gowers Norms of the Thue-Morse and Other Automatic Sequences
Abstract
The Thue-Morse sequence is perhaps the simplest example of an automatic sequence. Various pseudorandomness properties of this sequence have long been studied. During the talk, I will discuss a new result in this direction, asserting that the Gowers uniformity norms of the Thue-Morse sequence are small in a quantitative sense. Similar results hold for the Rudin-Shapiro sequence, as well as for a much wider class of automatic sequences which will be introduced during the talk.
The talk is partially based on joint work with Jakub Byszewski.
14:30
On the spectral problem for trivariate functions
Abstract
Using a variational approach applied to generalized Rayleigh functionals, we extend the concepts of singular values and singular functions to trivariate functions defined on a rectangular parallelepiped. We also consider eigenvalues and eigenfunctions for trivariate functions whose domain is a cube. For a general finite-rank trivariate function, we describe an algorithm for computing the canonical polyadic (CP) decomposition, provided that the CP factors are linearly independent in two variables. All these notions are computed using Chebfun. Application in finding the best rank-1 approximation of trivariate functions is investigated. We also prove that if the function is analytic and two-way orthogonally decomposable (odeco), then the CP values decay geometrically, and optimal finite-rank approximants converge at the same rate.
An Euler-Poincare formula for a depth zero Bernstein projector
Abstract
Work of Bezrukavnikov-Kazhdan-Varshavsky uses an equivariant system of trivial idempotents of Moy-Prasad groups to obtain an
Euler-Poincare formula for the r-depth Bernstein projector. We establish an Euler-Poincare formula for the projector to an individual depth zero Bernstein component in terms of an equivariant system of Peter-Weyl idempotents of parahoric subgroups P associated to a block of the reductive quotient of P. This work is joint with Dan Barbasch and Dan Ciubotaru.
14:00
Least-squares spectral methods for operator eigenvalue problems
Modelling congestion in supermarkets via queuing networks
Abstract
In this talk, I will talk about my current approach to model customer movements and in particular congestion inside supermarkets using queuing networks. As the research question for my project is ‘How should one design supermarkets to minimize congestion?’, I will then talk about my current progress in understanding how the network structure can affect this dynamics.
Symmetries of amplituhedron - merging algebraic and geometric approaches to planar N=4 SYM scattering amplitudes.
Linearisation of multi-well energies
Abstract
Linear elasticity can be rigorously derived from finite elasticity in the case of small loadings in terms of \Gamma-convergence. This was first done by Dal Maso-Negri-Percivale in the case of one-well energies with super-quadratic growth. This has been later generalised to different settings, in particular to the case of multi-well energies where the distance between the wells is very small (comparable to the size of the load). I will discuss recent developments in the case when the distance between the wells is arbitrary. In this context linear elasticity can be derived by adding to the multi-well energy a singular higher order term which penalises jumps from one well to another. The size of the singular term has to satisfy certain scaling assumptions which turn out to be optimal. (This is joint work with Alicandro, Dal Maso and Lazzaroni.)
Discretisation schemes for level sets of planar Gaussian fields
Abstract
Gaussian fields are prevalent throughout mathematics and the sciences, for instance in physics (wave-functions of high energy electrons), astronomy (cosmic microwave background radiation) and probability theory (connections to SLE, random tilings etc). Despite this, the geometry of such fields, for instance the connectivity properties of level sets, is poorly understood. In this talk I will discuss methods of extracting geometric information about levels sets of a planar Gaussian field through discrete observations of the field. In particular, I will present recent work that studies three such discretisation schemes, each tailored to extract geometric information about the levels set to a different level of precision, along with some applications.
Discrete Morse theory and classifying spaces
Abstract
Large-scale homology computations are often rendered tractable by discrete Morse theory. Every discrete Morse function on a given cell complex X produces a Morse chain complex whose chain groups are spanned by critical cells and whose homology is isomorphic to that of X. However, the space-level information is typically lost because very little is known about how critical cells are attached to each other. In this talk, we discretize a beautiful construction of Cohen, Jones and Segal in order to completely recover the homotopy type of X from an overlaid discrete Morse function.
Efficient Control Variates for Markov Chain Monte Carlo
Abstract
Monte Carlo methods are one of the main tools of modern statistics and applied mathematics. They are commonly used to approximate integrals, which allows statisticians to solve many tasks of interest such as making predictions or inferring parameter values of a given model. However, the recent surge in data available to scientists has led to an increase in the complexity of mathematical models, rendering them much more computationally expensive to evaluate. This has a particular bearing on Monte Carlo methods, which will tend to be much slower due to the high computational costs.
This talk will introduce a Monte Carlo integration scheme which makes use of properties of the integrand (e.g. smoothness or periodicity) in order to obtain fast convergence rates in the number of integrand evaluations. This will allow users to obtain much more precise estimates of integrals for a given number of model evaluations. Both theoretical properties of the methodology, including convergence rates, and practical issues, such as the tuning of parameters, will be discussed. Finally, the proposed algorithm will be illustrated on a Bayesian inverse problem for a PDE model of subsurface flow.
Moduli spaces of unstable curves
Abstract
The construction of the moduli spaces of stable curves of fixed genus is one of the classical applications of Mumford's geometric invariant theory (GIT). Here a projective curve is stable if it has only nodes as singularities and its automorphism group is finite. Methods from non-reductive GIT allow us to classify the singularities of unstable curves in such a way that we can construct moduli spaces of unstable curves of fixed singularity type.
Large Spin Pertubation Theory
Abstract
A conformal field theory is characterised by the CFT data, namely the spectrum of scaling dimensions and OPE coefficients. The idea of the conformal bootstrap is to use associativity of the operator algebra together with the symmetries of the theory to constraint the CFT data. For the sector of operators with large spin one can actually use these ideas to obtain analytical results. It was recently understood how to set up a systematic expansion around this sector, leading to analytic results to all orders in inverse powers of the spin. We will show how to use this large spin perturbation theory to obtain analytic results for vast families of CFTs. Some of the applications include vector models, weakly coupled gauge theories and the computation of loops for scalar theories in AdS.
Applied Mathematics Open Day
Abstract
In Your Third Year & want to find out about opportunities for summer placements and future graduate study?
Why not visit Oxford and hear from graduate students about their research
Saturday 21 January 2017: 1-6pm
Mathematical Institute, University of Oxford
TALKS ON
- Dynamics of jumping elastic toys
- Vertex models in developmental biology
- Modelling of glass sheets
- Glimpse into the mathematics of information
- Network analysis of consumer data
- Complex singularities in jet and splash flows
Complementary Lunch & Drinks Reception - TRAVEL BURSARIES AVAILABLE (up to £50)
Please RSVP to @email
Applied Mathematics Open Day
Abstract
In Your Third Year & want to find out about opportunities for
summer placements and future graduate study?
Why not visit Oxford and hear from graduate students about their research
TALKS ON
Dynamics of jumping elastic toys
Vertex models in developmental biology
Modelling of glass sheets
Glimpse into the mathematics of information
Network analysis of consumer data
Complex singularities in jet and splash flows
Complementary Lunch & Drinks Reception - TRAVEL BURSARIES AVAILABLE (up to £50)
Please RSVP to @email
North meets South Colloquium
Abstract
A continuum of expanders -- David Hume

Expanders are a holy grail of networking; robustly connected networks of arbitrary size which require minimal resources. Like the grail, they are also notoriously difficult to construct. In this talk I will introduce expanders, give a brief overview of just a few aspects of their diverse history, and outline a very recent result of mine, which states that there are a continuum of expanders with fundamentally different large-scale geometry.
What makes cities successful? A complex systems approach to modelling urban economies -- Neave O'Clery

Urban centres draw a diverse range of people, attracted by opportunity, amenities, and the energy of crowds. Yet, while benefiting from density and proximity of people, cities also suffer from issues surrounding crime, congestion and density. Seeking to uncover the mechanisms behind the success of cities using novel tools from the mathematical and data sciences, this work uses network techniques to model the opportunity landscape of cities. Under the theory that cities move into new economic activities that share inputs with existing capabilities, path dependent industrial diversification can be described using a network of industries. Edges represent shared necessary capabilities, and are empirically estimated via flows of workers moving between industries. The position of a city in this network (i.e., the subnetwork of its current industries) will determine its future diversification potential. A city located in a central well-connected region has many options, but one with only few peripheral industries has limited opportunities.
We develop this framework to explain the large variation in labour formality rates across cities in the developing world, using data from Colombia. We show that, as cities become larger, they move into increasingly complex industries as firms combine complementary capabilities derived from a more diverse pool of workers. We further show that a level of agglomeration equivalent to between 45 and 75 minutes of commuting time maximizes the ability of cities to generate formal employment using the variety of skills available. Our results suggest that rather than discouraging the expansion of metropolitan areas, cities should invest in transportation to enable firms to take advantage of urban diversity.
This talk will be based on joint work with Eduardo Lora and Andres Gomez at Harvard University.
Fibre-reinforced fluids: from plants to extracellular matrix and beyond
Title: Infinite mutations on marked surfaces
Abstract
Abstract: Triangulations of surfaces serve as important examples for cluster theory, with the natural operation of “diagonal flips” encoding mutation in cluster algebras and categories. In this talk we will focus on the combinatorics of mutation on marked surfaces with infinitely many marked points, which have gained importance recently with the rising interest in cluster algebras and categories of infinite rank. In this setting, it is no longer possible to reach any triangulation from any other triangulation in finitely many steps. We introduce the notion of mutation along infinite admissible sequences and show that this induces a preorder on the set of triangulations of a fixed infinitely marked surface. Finally, in the example of the completed infinity-gon we define transfinite mutations and show that any triangulation of the completed infinity-gon can be reached from any other of its triangulations via a transfinite mutation. The content of this talk is joint work with Karin Baur.
16:00
Joint Logic/Number Theory Seminar: Formality and higher Massey products in Galois cohomology
Abstract
There are several conjectures in the literature suggesting that absolute Galois groups of fields tend to be "as free as possible," given their "almost-abelian" data.
This can be made precise in various ways, one of which is via the notion of "1-formality" arising in analogy with the concept in rational homotopy theory.
In this talk, I will discuss several examples which illustrate this phenomenon, as well as some surprising diophantine consequences.
This discussion will also include some recent joint work with Guillot, Mináč, Tân and Wittenberg, concerning the vanishing of mod-2 4-fold Massey products in the Galois cohomology of number fields.
Networks and Function
Abstract
Averaging, either spatial or temporal, is a powerful technique in complex multi-scale systems.
However, in some situations it can be difficult to justify.
For example, many real-world networks in technology, engineering and biology have a function and exhibit dynamics that cannot always be adequately reproduced using network models given by the smooth dynamical systems and fixed network topology that typically result from averaging. Motivated by examples from neuroscience and engineering, we describe a model for what we call a "functional asynchronous network". The model allows for changes in network topology through decoupling of nodes and stopping and restarting of nodes, local times, adaptivity and control. Our long-term goal is to obtain an understanding of structure (why the network works) and how function is optimized (through bifurcation).
We describe a prototypical theorem that yields a functional decomposition for a large class of functional asynchronous networks. The result allows us to express the function of a dynamical network in terms of individual nodes and constituent subnetworks.
16:00
Joint Logic/Number Theory Seminar: Formality and higher Massey products in Galois cohomology
Abstract
There are several conjectures in the literature suggesting that absolute Galois groups of fields tend to be "as free as possible," given their "almost-abelian" data.
This can be made precise in various ways, one of which is via the notion of "1-formality" arising in analogy with the concept in rational homotopy theory.
In this talk, I will discuss several examples which illustrate this phenomenon, as well as some surprising diophantine consequences.
This discussion will also include some recent joint work with Guillot, Mináč, Tân and Wittenberg, concerning the vanishing of mod-2 4-fold Massey products in the Galois cohomology of number fields.
On the worst-case performance of the optimization method of Cauchy for smooth, strongly convex functions
Abstract
We consider the Cauchy (or steepest descent) method with exact line search applied to a strongly convex function with Lipschitz continuous gradient. We establish the exact worst-case rate of convergence of this scheme, and show that this worst-case behavior is exhibited by a certain convex quadratic function. We also give worst-case complexity bound for a noisy variant of gradient descent method. Finally, we show that these results may be applied to study the worst-case performance of Newton's method for the minimization of self-concordant functions.
The proofs are computer-assisted, and rely on the resolution of semidefinite programming performance estimation problems as introduced in the paper [Y. Drori and M. Teboulle. Performance of first-order methods for smooth convex minimization: a novel approach. Mathematical Programming, 145(1-2):451-482, 2014].
Joint work with F. Glineur and A.B. Taylor.
11:00
Towards a Ladder Theorem for Specialisations
Abstract
In this talk I will present some answers to the question when every specialisation from a \kappa-saturated extension of
a Zariski structure is \kappa-universal? I will show that for algebraically closed fields, all specialisations from a \kappa-
saturated extension is \kappa-universal. More importantly, I will consider this question for finite and infinite covers of
Zariski structures. In these cases I will present a counterexample to show that there are covers of Zariski structures
which have specialisations from a \kappa-saturated extension that are not \kappa-universal. I will present some natural
conditions on the fibres under which all specialisations from a \kappa-saturated extension of a cover is \kappa-universal.
I will explain how this work points towards a prospective Ladder Theorem for Specialisations and explain difficulties and
further works that needs to be considered.