Past

Adjoint derivatives reveal the sensitivity of a computer program's output to changes in its inputs. These derivatives are useful as a building block for optimisation, uncertainty quantification, noise estimation, inverse design, etc., in many industrial and scientific applications that use PDE solvers or other codes.
Algorithmic differentiation (AD) is an established method to transform a given computation into its corresponding adjoint computation. One of the key challenges in this process is the efficiency of the resulting adjoint computation. This becomes especially pressing with the increasing use of shared-memory parallelism on multi- and many-core architectures, for which AD support is currently insufficient.
In this talk, I will present an overview of challenges and solutions for the differentiation of shared-memory-parallel code, using two examples: an unstructured-mesh CFD solver, and a structured-mesh stencil kernel, both parallelised with OpenMP. I will show how AD can be used to generate adjoint solvers that scale as well as their underlying original solvers on CPUs and a KNC XeonPhi. The talk will conclude with some recent efforts in using AD and formal verification tools to check the correctness of manually optimised adjoint solvers.
 

I will talk about the fluid equations used to model pedestrian motion and traffic. I will present the compressible-incompressible Navier-Stokes two phase system describing the flow in the free and in the congested regimes, respectively. I will also show how to approximate such system by the compressible Navier-Stokes equations with singular pressure for the fixed barrier densities and also some recent developments for the barrier densities varying in the space and time.
This is a talk based on several papers in collaboration with: D. Bresch, C. Perrin, P. Degond, P. Minakowski, and L. Navoret.
 

We will follow a suggestion by Udi to construct a decidable field which has an undecidable finite extension.

In my talk I will give a basic introduction to the finiteness properties of groups and their relation to subgroups of direct products of groups. I will explain the relation between such subgroups and fibre products of groups, and then proceed with a discussion of the n-(n+1)-(n+2)-Conjecture and the Virtual Surjections Conjecture. While both conjectures are still open in general, they are known to hold in special cases. I will explain how these results can be applied to prove that there are groups with arbitrary (non-)finiteness properties.

Komlós conjectured in 1981 that among all graphs with minimum degree at least $d$, the complete graph $K_{d+1}$ minimises the number of Hamiltonian subsets, where a subset of vertices is Hamiltonian if it contains a spanning cycle. We prove this conjecture when $d$ is sufficiently large.  In fact we prove a stronger result: for large $d$, any graph $G$ with average degree at least $d$ contains almost twice as many Hamiltonian subsets as $K_{d+1}$, unless $G$ is isomorphic to $K_{d+1}$ or a certain other graph which we specify. This is joint work with Hong Liu, Maryam Sharifzadeh and Katherine Staden.

One of the greatest challenges in developing renewable energy sources is finding an efficient energy storage solution to smooth out the inherently fluctuating supply. One cheap solution is lead-acid batteries, which are used to provide off-grid solar energy in developing countries. However, modelling of this technology has fallen behind other types of battery; the state-of-the-art models are either overly simplistic, fitting black-box functions to current and voltage data, or overly complicated, requiring complex and time-consuming numerical simulations. Neither of these methods offers great insight into the chemical behaviour at the micro-scale.

In our research, we use asymptotic methods to explore the Newman porous-electrode model for a constant-current discharge at low current densities, a good estimate for real-life applications. In this limit, we obtain a simple yet accurate formula for the cell voltage as a function of current density and time. We also gain quantitative insight into the effect of various parameters on this voltage. Further, our model allows us to quantitatively investigate the effect of ohmic resistance and mass transport limitations, as a correction to the leading order cell voltage. Finally, we explore the effect on cell voltage of other secondary phenomena, such as growth of a discharge-product layer in the pores and reaction-induced volume changes in the electrolyte.

In the cosmological scheme of conformal cyclic cosmology (CCC), the equations governing the crossover form each aeon to the next demand the creation of a dominant new scalar material that is postulated to be dark matter. In order that this material does not build up from aeon to aeon, it is taken to decay away completely over the history of the aeon. The dark matter particles (erebons) would be expected to behave as essentially classical particles of around a Planck mass, interacting only gravitationally, and their decay would be mainly responsible for the (~scale invariant)

temperature fluctuations in the CMB of the succeeding aeon. In our own aeon, erebon decay ought to be detectable as impulsive events observable by gravitational wave detectors.

The contact line problem in interfacial fluid mechanics concerns the triple-junction between a fluid, a solid, and a vapor phase. Although the equilibrium configurations of contact lines have been well-understood since the work of Young, Laplace, and Gauss, the understanding of contact line dynamics remains incomplete and is a source of work in experimentation, modeling, and mathematical analysis. In this talk we consider a 2D model of contact point (the 2D analog of a contact line) dynamics for an incompressible, viscous, Stokes fluid evolving in an open-top vessel in a gravitational field. The model allows for fully dynamic contact angles and points. We show that small perturbations of the equilibrium configuration give rise to global-in-time solutions that decay to equilibrium exponentially fast.  This is joint with with Yan Guo.

Boundaries of hyperbolic spaces have played a key role in low dimensional topology and geometric group theory.  In 1993, Paulin showed that the topology of the boundary of a (Gromov) hyperbolic space, together with its quasi-mobius structure, determines the space up to quasi-isometry.  One can define an analogous boundary, called the Morse boundary, for any proper geodesic metric space.  I will discuss an analogue of Paulin’s theorem for Morse boundaries of CAT(0) spaces. (Joint work with Devin Murray.)

We consider a class of nonlinear population models on a two-dimensional lattice which are influenced by a small random potential, and we show that on large temporal and spatial scales the population density is well described by the continuous parabolic Anderson model, a linear but singular stochastic PDE. The proof is based on a discrete formulation of paracontrolled distributions on unbounded lattices which is of independent interest because it can be applied to prove the convergence of a wide range of lattice models. This is joint work with Jörg Martin.

Reinhard Farwig and Chenyin Qian

Consider the autonomous quasi-geostrophic equation with fractional dissipation in $\mathbb{R}^2$
  \begin{equation} \label{a}
 \theta_t+u\cdot\nabla\theta+(-\Delta)^{\alpha}\theta=f(x,\theta)
 \end{equation}
in the subcritical case $1/2<\alpha\leq1$, with initial condition $\theta(x, 0)= \theta^{0}$ and given external force $f(x,\theta)$. Here the real scalar function $\theta$ is the so-called potential temperature, and the incompressible velocity field $u=(u_1,u_2)=(-\mathcal {R}_2\theta,\mathcal {R}_1\theta)$ is determined from $\theta$ via Riesz operators.  Our aim is to prove the existence of the compact global attractor $\mathcal{A}$ in the Bessel potential space $H^s(\mathbb{R}^2)$ when $s>2(1-\alpha)$.

The  construction of the attractor is based on the existence of an absorbing set in $L^2(\mathbb{R}^2)$ and $H^s(\mathbb{R}^2)$ where $s>2(1-\alpha)$. A second major step is usually based on compact Sobolev embeddings which unfortunately do not hold for unbounded domains. To circumvent this problem we exploit compact Sobolev embeddings on  balls $B_R \subset \mathbb{R}^2$ and uniform smallness estimates of solutions on $\mathbb{R}^2 \setminus B_R$. In the literature the latter estimates are obtained by a damping term $\lambda\theta$, $\lambda<0$, as part of the right hand side $f$ to guarantee exponential decay estimates. In our approach we exploit a much weaker nonlocal damping term of convolution type $\rho*\theta$ where $\widehat \rho<0$. 

TBC

We describe a general program for the classification of flat connections on topological manifolds. This is motivated by the classification of locally homogeneous geometric structures on manifolds, in the spirit of Ehresmann and Thurston.  This leads to interesting dynamical systems arising from mapping class group actions on character varieties. The mapping class group action is a discrete version of a continuous object, namely the extension of the Teichmueller flow to a  unversal character variety over over the tangent bundle of Teichmuller space. We give several examples of this construction
and discuss joint work with Giovanni Forni on a mixing property of this suspended flow.

The cover of the December 2016 AMS Notices shows an eye-like region picked out by blue and red dots and surrounded by green rays. The picture, drawn by Yasushi Yamashita, illustrates Gaven Martin’s search for the smallest volume 3-dimensional hyperbolic orbifold. It represents a family of two generator groups of isometries of hyperbolic 3-space which was recently studied, for quite different reasons, by myself, Yamashita and Ser Peow Tan.

After explaining the coloured dots and their role in Martin’s search, we concentrate on the green rays. These are Keen-Series pleating rays which are used to locate spaces of discrete groups. The theory also suggests why groups represented by the red dots on the rays in the inner part of the eye display some interesting geometry.
 

Building on advancements in computer vision we now have an array of visual tracking methods that allow the reliable estimation of cellular motion in high-throughput settings as well as more complex biological specimens. In many cases the underlying assumptions of these methods are still not well defined and result in failures when analysing large scale experiments.

Using organotypic co-culture systems we can now mimic more physiologically relevant microenvironments in vitro.  The robust analysis of cellular dynamics in such complex biological systems remains an open challenge. I will attempt to outline some of these challenges and provide some very preliminary results on analysing more complex cellular behaviours.

Martingale optimal transport is a variant of the classical optimal transport problem where a martingale constraint is imposed on the coupling. In a recent paper, Beiglböck, Nutz and Touzi show that in dimension one there is no duality gap and that the dual problem admits an optimizer. A key step towards this achievement is the characterization of the polar sets of the family of all martingale couplings. Here we aim to extend this characterization to arbitrary finite dimension through a deeper study of the convex order

 

I will explain how to prove the exactness of the homotopy sequence of overconvergent p-adic fundamental groups for a smooth and projective morphism in characteristic p. We do so by first proving a corresponding result for rigid analytic varieties in characteristic 0, following dos Santos in the algebraic case. In characteristic p we proceed by a series of reductions to the case of a liftable family of curves, where we can apply the rigid analytic result. Joint work with Chris Lazda.

The National Physical Laboratory is the national measurement institute. Researchers in the Data Science Division analyse various types of data using mathematical, statistical and machine learning based methods. The goal of the workshop is to describe a set of exciting mathematical problems that are of interest to NPL and more generally to the Data Science community. In particular, I will describe the problem of clustering using minimum spanning trees (MST-Clustering), Non-Negative Matrix Factorisation (NMF), adaptive Compressed Sensing (CS) for tomography, and sparse polynomial chaos expansion (PCE) for parametrised PDE’s.

Motivated by the Dixmier-Moeglin equivalence, which belongs to the realm of algebra representations, we look at a differential version of this equivalence for algebraic D-groups, which belong to the realm of finite Morley rank groups in differentially closed fields. We will see how the proof of this equivalence reduces to a standard model-theoretic fact (on binding groups). Time permitting we will present an application to Hopf-Ore extensions. This is joint work with J. Bell and R. Moosa.

It is a standard heuristic that sums of oscillating number theoretic functions, like the M\"obius function or Dirichlet characters, should exhibit squareroot cancellation. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will discuss recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation.