Fri, 27 Jul 2018

15:00 - 15:30
L6

Meeting under the integral sign? The 1936 Oslo International Congress of Mathematicians

Christopher Hollings
(Oxford)
Abstract

The International Congresses of Mathematicians (ICMs) have taken place at (reasonably) regular intervals since 1897, and although their participants may have wanted to confine these events purely to mathematics, they could not help but be affected by wider world events.  This is particularly true of the 1936 ICM, held in Oslo.  In this talk, I will give a whistle-stop tour of the early ICMs, before discussing the circumstances of the Oslo meeting, with a particular focus on the activities of the Nazi-led German delegation.

Tue, 01 May 2018

14:30 - 15:00
L5

Weakly-normal basis vector fields in RKHS with an application to shape Newton methods

Alberto Paganini
(Oxford)
Abstract

We construct a space of vector fields that are normal to differentiable curves in the plane. Its basis functions are defined via saddle point variational problems in reproducing kernel Hilbert spaces (RKHSs). First, we study the properties of these basis vector fields and show how to approximate them. Then, we employ this basis to discretise shape Newton methods and investigate the impact of this discretisation on convergence rates.

Tue, 01 May 2018

14:00 - 14:30
L5

Scalable Least-Squares Minimisation for Bundle Adjustment Problem

Lindon Roberts
(Oxford)
Abstract

Structure from Motion (SfM) is a problem which asks: given photos of an object from different angles, can we reconstruct the object in 3D? This problem is important in computer vision, with applications including urban planning and autonomous navigation. A key part of SfM is bundle adjustment, where initial estimates of 3D points and camera locations are refined to match the images. This results in a high-dimensional nonlinear least-squares problem, which is typically solved using the Gauss-Newton method. In this talk, I will discuss how dimensionality reduction methods such as block coordinates and randomised sketching can be used to improve the scalability of Gauss-Newton for bundle adjustment problems.

Tue, 24 Apr 2018

14:00 - 14:30
L3

Block preconditioners for non-isothermal flow through porous media

Thomas Roy
(Oxford)
Abstract

In oil and gas reservoir simulation, standard preconditioners involve solving a restricted pressure system with AMG. Initially designed for isothermal models, this approach is often used in the thermal case. However, it does not incorporate heat diffusion or the effects of temperature changes on fluid flow through viscosity and density. We seek to develop preconditioners which consider this cross-coupling between pressure and temperature. In order to study the effects of both pressure and temperature on fluid and heat flow, we first consider a model of non-isothermal single phase flow through porous media. By focusing on single phase flow, we are able to isolate the properties of the pressure-temperature subsystem. We present a numerical comparison of different preconditioning approaches including block preconditioners.

Mon, 30 Apr 2018
12:45
L3

Algebraic systems biology: comparing models and data.

Heather Harrington
(Oxford)
Abstract

I will overview my research for a general math audience.

 First I will present the biological questions and motivate why systems biology needs computational algebraic biology and topological data analysis. Then I will present the mathematical methods I've developed to study these biological systems. Throughout I will provide examples.

 
 
Mon, 07 May 2018
12:45
L3

A Ringel-Hall type construction of vertex algebras

Dominic Joyce
(Oxford)
Abstract



 Suppose A is a nice abelian category (such as coherent sheaves coh(X) on a smooth complex projective variety X, or representations mod-CQ of a quiver Q) or T is a nice triangulated category (such as D^bcoh(X) or D^bmod-CQ) over C. Let M be the moduli stack of objects in A or T. Consider the homology H_*(M) over some ring R.
  Given a little extra data on M, for which there are natural choices in our examples, I will explain how to define the structure of a graded vertex algebra on H_*(M). By a standard construction, one can then define a graded Lie algebra from the vertex algebra; roughly speaking, this is a Lie algebra structure on the homology H_*(M^{pl}) of a "projective linear” version M^{pl} of the moduli stack M.
  For example, if we take T = D^bmod-CQ, the vertex algebra H_*(M) is the lattice vertex algebra attached to the dimension vector lattice Z^{Q_0} of Q with the symmetrized intersection form. The degree zero part of the graded Lie algebra contains the associated Kac-Moody algebra.
  The construction appears to be new, but is connected with a lot of work in Geometric Representation Theory, to do with Ringel-Hall-type algebras and their representations, such as the results of Grojnowski-Nakajima on Hilbert schemes. The vertex algebra construction is enormously general, and applies in huge classes of examples. There is a differential-geometric version too.
  The question I am hoping someone in the audience will answer is this: what is the physical interpretation of these vertex algebras?
  It is in some sense an "even Calabi-Yau” construction: when applied to coh(X) or D^bcoh(X), it is most natural for X a Calabi-Yau 2-fold or Calabi-Yau 4-fold, and is essentially trivial for X a Calabi-Yau 3-fold. I discovered it when I was investigating wall-crossing for Donaldson-Thomas type invariants for Calabi-Yau 4-folds. So perhaps one should look for an explanation in the physics of Calabi-Yau 2-folds or 4-folds, with M the moduli space of boundary conditions for the associated SCFT.

 
 
Tue, 22 May 2018

16:00 - 17:00
L5

Some questions on class field theory and model theory

Minhyong Kim
(Oxford)
Abstract

This lecture will give a brief review of the theory of non-abelian reciprocity maps and their applications to Diophantine geometry, and pose some questions for model-theorists.
 

Tue, 24 Apr 2018

14:30 - 15:00
L3

Randomized algorithms for computing full, rank-revealing factorizations

Abinand Gopal
(Oxford)
Abstract

Over the past decade, the randomized singular value decomposition (RSVD) algorithm has proven to be an efficient, reliable alternative to classical algorithms for computing low-rank approximations in a number of applications. However, in cases where no information is available on the singular value decay of the data matrix or the data matrix is known to be close to full-rank, the RSVD is ineffective. In recent years, there has been great interest in randomized algorithms for computing full factorizations that excel in this regime.  In this talk, we will give a brief overview of some key ideas in randomized numerical linear algebra and introduce a new randomized algorithm for computing a full, rank-revealing URV factorization.

Subscribe to Oxford