Past

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.

Understanding the spatial distribution of organisms throughout an environment is an important topic in population ecology. We briefly review ecological questions underpinning certain mathematical work that has been done in this area, before presenting a few examples of spatially structured population models. As a first example, we consider a model of two species aggregation and clustering in two-dimensional domains in the presence of heterogeneity, and demonstrate novel aggregation mechanisms in this setting. We next consider a second example consisting of a predator-prey-subsidy model in a spatially continuous domain where the spatial distribution of the subsidy influences the stability and spatial structure of steady states of the system. Finally, we discuss ongoing work on extending such results to network-structured domains, and discuss how and when the presence of a subsidy can stabilize predator-prey dynamics."

-------------------------------------------------------------------------------------------------------------------------------

Compaction is a primary process in the evolution of a sedimentary basin. Various 1D models exist to model a basin compacting due to overburden load. We explore a multi-dimensional model for a basin undergoing mechanical and chemical compaction. We discuss some properties of our model. Some test cases in the presence of geological features are considered, with appropriate numerical techniques presented.

This document reviews the so called least square methodology (LSM) and its application for the valuation and risk of callable exotics and regulatory value adjustments (xVA). We derive valuation algorithms for xVA, both with or without collateral, that are particularly accurate, efficient and practical. These algorithms are based on a reformulation of xVA, designed by Jesper Andreasen and implemented in Danske Bank's award winning systems, that hasn't been previously published in full. We then investigate the matter of risk sensitivities, in the context of Algorithmic Automated Differentiation (AAD). A rather recent addition to the financial mathematics toolbox, AAD is presently generally acknowledged as a vastly superior alternative to the classical estimation of risk sensitivities through finite differences, and the only practical means for the calculation of the large number of sensitivities in the context of xVA. The theory and implementation of AAD, the related check-pointing techniques, and their application to Monte-Carlo simulations are explained in numerous textbooks and articles, including Giles and Glasserman's pioneering Smoking Adjoints. We expose an extension to LSM, and, in particular, we derive an original algorithm that resolves the matters of memory consumption and efficiency in differentiating simulations together with the LSM step.

Gauss invented Gaussian quadrature following an approach entirely different from the one we now find in textbooks. I will describe leisurely the contents of Gauss's original memoir on quadrature, an impressive piece of mathematics, based on continued fractions, Padé approximation, generating functions, the hypergeometric series and more.

Divergence-measure fields are $L^{p}$-summable vector fields on $\mathbb{R}^{n}$ whose divergence is a Radon measure. Such vector fields form a new family of function spaces, which in a sense generalize the $BV$ fields, and were introduced at first by Anzellotti, before being rediscovered in the early 2000s by many authors for different purposes.
Chen and Frid were interested in the applications to the theory of systems of conservation laws with the Lax entropy condition and achieved a Gauss-Green formula for divergence-measure fields, for any $1 \le p \le \infty$, on open bounded sets with Lipschitz deformable boundary. We show in this talk that any Lipschitz domain is deformable.
Later, Chen, Torres and Ziemer extended this result to the sets of finite perimeter in the case $p = \infty$, showing in addition that the interior and exterior normal traces of the vector field are essentially bounded functions.
The Gauss-Green formula for $1 \le p \le \infty$ has been also studied by Silhavý on general open sets, and by Schuricht on compact sets. In such cases, the normal trace is not in general a summable function: it may even not be a measure, but just a distribution of order 1. However, we can show that such a trace is the limit of the integral of classical normal traces on (smooth) approximations of the integration domain.

 I will discuss my ongoing project towards a version of the Modular Andre-Oort Conjecture incorporating the derivatives of the j function.  The work originates with Jonathan Pila, who formulated the first "Modular Andre-Oort with Derivatives" conjecture.  The problem can be approached via o-minimality; I will discuss two categories of result.  The first is a weakened version of Jonathan's conjecture.  Under an algebraic independence conjecture (of my own, though it follows from standard conjectures), the result is equivalent to the statement that Jonathan's conjecture holds.  
The second result is conditional on the same algebraic independence conjecture - it specifies more precisely how the special points in varieties can occur in this context.  
If time permits, I will discuss my most recent work towards making the two results uniform in algebraic families.

Direct Anonymous Attestation (DAA) is a protocol that allows a security chip embedded in a platform such as laptop to authenticate itself as a genuine chip.  Different authentications are not linkeable, thus the protocol protects the privacy of the platform. The first DAA protocol was proposed by Brickell, Chen, and Camenisch and was standardized in 2004 by the Trusted Computing Group (TCG). Implementations of this protocols were rather slow because it is based on RSA. Later, alternative and faster protocols were proposed based on elliptic curves. Recently the specification by the TCG was updated to allow for DAA protocols based on elliptic curves. Unfortunately, the new standard does not allow for provably secure DAA protocols. In this talk, we will review some of the history of DAA and  then discuss the latest protocols, security models, and finally a provably secure realization of DAA based on elliptic curves.

It is well known that there is a finite colouring of the natural numbers such that there is no infinite set X with X+X (the pairwise sums from X, allowing repetition) monochromatic. It is easy to extend this to the rationals. Hindman, Leader and Strauss showed that there is also such a colouring of the reals, and asked if there exists a space 'large enough' that for every finite colouring there does exist an infinite X with X+X monochromatic. We show that there is indeed such a space. Joint work with Imre Leader.

Magnus expansion based methods are an efficient class of integrators for solving Schrödinger equations that feature time dependent potentials such as lasers. These methods have been found to be highly effective in computational quantum chemistry since the pioneering work of Tal Ezer and Kosloff in the early 90s. The convergence of the Magnus expansion, however, is usually understood only for ODEs and traditional analysis suggests a much poorer performance of these methods than observed experimentally. It was not till the work of Hochbruck and Lubich in 2003 that a rigorous analysis justifying the application to PDEs with unbounded operators, such as the Schrödinger equation, was presented. In this talk we will extend this analysis to the semiclassical regime, where the highly oscillatory solution conventionally suggests large errors and a requirement for very small time steps.
 

In everyday language, this talk studies the question about the optimal shape and location of a thermometer of a given volume to reconstruct the temperature distribution in an entire room. For random initial conditions, this problem was considered by Privat, Trelat and Zuazua (ARMA, 2015), and for short times we remove both the randomness and geometric assumptions in their article. Analytically, we obtain quantitative estimates for the well-posedness of an inverse problem, in which one determines the solution in the whole domain from its restriction to a subset of given volume. Using a new decomposition of $L^2(\Rd)$ into heat packets from microlocal analysis, we conclude that there exists a unique optimal such subset, that it is semi-analytic and can be approximated numerically by solving a sequence of finite-dimensional optimization problems. (joint with Alden Waters)
 

The (kinetic) Langevin equation is an SDE with degenerate noise that describes the motion of a particle in a force field subject to damping and random collisions. It is also closely related to Hamiltonian Monte Carlo methods. An important open question is, why in certain cases kinetic Langevin diffusions seem to approach equilibrium faster than overdamped Langevin diffusions. So far, convergence to equilibrium for kinetic Langevin diffusions has almost exclusively been studied by analytic techniques. In this talk, I present a new probabilistic approach that is based on a specific combination of reflection and synchronous coupling of two solutions of the Langevin equation. The approach yields rather precise bounds for convergence to equilibrium at the borderline between the overdamped and the underdamped regime, and it may help to shed some light on the open question mentioned above.

 There is a routine for obtaining formulae for derivatives of smooth heat semigroups,and for certain heat semigroups acting on differential forms etc, established some time ago by myself, LeJan, & XueMei Li.  Following a description of this in its general form, I will discuss its applicability in some sub-Riemannian situations and to higher order derivatives.

Transport properties of liquids and gases in the regime of weak coupling (or effective weak coupling) are determined by the solutions of relevant kinetic equations for particles or quasiparticles, with transport coefficients being proportional to the minimal eigenvalue of the linearized kinetic operator. At strong coupling, the same physical quantities can sometimes be determined from dual gravity, where quasinormal spectra enter as the eigenvalues of the linearized Einstein's equations. We discuss the problem of interpolating between the two regimes using results from higher derivative gravity.

In this session we will refresh our understanding of the purpose of an interview, review some top tips, and practise answering some typical interview questions. Rachel will also signpost further resources on interview preparation available at the Careers Service.

Over the last few decades, a number of authors have discussed the analogy between linking numbers in three manifold topology and symbols in arithmetic. This talk will outline some results that make this precise in terms of natural complexes associated to arithmetic duality theorems. In particular, we will describe a ‘finite path integral’ formula for power residue symbols.

Dedalus is a new open-source framework for solving general partial differential equations using spectral methods.  It is designed for maximum extensibility and incorporates features such as symbolic equation entry, custom domain construction, and automatic MPI parallelization.  I will briefly describe key algorithmic features of the code, including our sparse formulation and support for general tensor calculus in curvilinear domains.  I will then show examples of the code’s capabilities with various applications to astrophysical and geophysical fluid dynamics, including a compressible flow benchmark against a finite volume code, and direct numerical simulations of turbulent glacial melting

In the first part of my presentation, I will briefly summarize a dynamic view of the cell cycle created in collaboration with Prof John Tyson over the past 25 years. 
In our view, the decisions a cell must make during DNA synthesis and mitosis are controlled by bistable switches, which provide abrupt and irreversible transition 
between successive cell cycle phases. In addition, bistability provides the foundation for 'checkpoints' that can stop cell proliferation if problems arise 
(e.g., DNA damage by UV irradiation). In the second part of my talk, I will highlight a few representative examples from our ongoing BBSRC Strategic LoLa grant 
(http://cellcycle.org.uk/) in which we are testing the predictions of our theoretical ideas in human cells in collaboration with four experimental groups.

I will discuss how relations among natural generators of the  Hall algebra of vector bundles on a curve over F_q are related to the zeroes of the zeta function of the curve.

According to a classical result of Bertoin (1998), if the initial data for Burgers equation is a Levy Process with no positive jump, then the same is true at later times, and there is an explicit equation for the evolution of the associated Levy measures. In 2010, Menon and Srinivasan published a conjecture for the statistical structure of solutions to scalar conservation laws with certain Markov initial conditions, proposing a kinetic equation that should suffice to describe the solution as a stochastic process in x with t fixed (or in t with x fixed). In a joint work with Dave Kaspar, we have been able to establish this conjecture. Our argument uses a particle system representation of solutions.

Given a representation of Gal_{Q_p} with coefficients in a p-adically complete local ring R, Fukaya and Kato have conjectured the existence of a canonical trivialization of the determinant of a certain cohomology complex.  When R=Z_p and the representation is a lattice in a de Rham representation, this trivialization should be related to the \varepsilon-factor of the corresponding Weil--Deligne representation.  Such a trivialization has been constructed for certain crystalline Galois representations, by the work of a number of authors. I will explain how to extend these trivializations to certain families of crystalline Galois representations.  This is joint work with Otmar Venjakob.

[[{"fid":"47873","view_mode":"default","fields":{"format":"default"},"type":"media","attributes":{"class":"file media-element file-default"},"link_text":"AD abstract.pdf"}]]

Soft active materials are largely employed to realize devices (actuators), where deformations and displacements are triggered by a wide range of external stimuli such as electric field, pH, temperature, and solvent absorption. The effectiveness of these actuators critically depends on the capability of achieving prescribed changes in their shape and size and on the rate of changes. In particular, in gel–based actuators, the shape of the structures can be related to the spatial distribution of the solvent inside the gel, to the magnitude and the rate of solvent uptake.

In the talk, I am going to discuss some results obtained by my group regarding surface patterns arising in the transient dynamics of swelling gels [1,2], based on the stress diffusion model we presented a few years ago [3]. I am also going to show our extended stress diffusion model suited for investigating swelling processes in fiber gels, and to discuss shape formation issues in presence of fiber gels [4-6].

[1]   A. Lucantonio, M. Rochè, PN, H.A. Stone. Buckling dynamics of a solvent-stimulated stretched elastomeric sheet. Soft Matter 10, 2014.

[2]   M. Curatolo, PN, E. Puntel, L. Teresi. Full computational analysis of transient surface patterns in swelling hydrogels. Submitted, 2017.

[3]   A. Lucantonio, PN, L. Teresi. Transient analysis of swelling-induced large deformations in polymer gels. JMPS 61, 2013.

[4]   PN, M. Pezzulla, L. Teresi. Anisotropic swelling of thin gel sheets. Soft Matter 11, 2015.

[5]   PN, M. Pezzulla, L. Teresi. Steady and transient analysis of anisotropic swelling in fibered gels. JAP 118, 2015.

[6]   PN, L. Teresi. Actuation performances of anisotropic gels. JAP 120, 2016.

The talk will describe accelerated algorithms for computing full or partial matrix factorizations such as the eigenvalue decomposition, the QR factorization, etc. The key technical novelty is the use of  randomized projections to reduce the effective dimensionality of  intermediate steps in the computation. The resulting algorithms execute faster on modern hardware than traditional algorithms, and are particularly well suited for processing very large data sets.

The algorithms described are supported by a rigorous mathematical analysis that exploits recent work in random matrix theory. The talk will briefly review some representative theoretical results.

The Constantin-Lax-Majda model is a 1d system which shares certain features (related to vortex stretching) with the 3d Euler equation. The model is explicitly solvable and exhibits finite-time blow-up for an open subset of smooth initial data. In 1990s De Gregorio suggested adding a transport term to the system, which is analogous to the transport term in the Euler equation. It turns out the transport term has some regularizing effects, which we will discuss in the lecture.

Moduli spaces attempt to classify all mathematical objects of a particular type, for example algebraic curves or vector bundles, and record how they 'vary in families'. Often they are constructed using Geometric Invariant Theory (GIT) as a quotient of a parameter space by a group action. A common theme is that in order to have a nice (eg Hausdorff) space one must restrict one's attention to a suitable subclass of 'stable' objects, in effect leaving certain badly behaved objects out of the classification. Assuming no prior familiarity, I will elucidate the structure of instability in GIT, and explain how recent progress in non-reductive GIT allows one to construct moduli spaces for these so-called 'unstable' objects. The particular focus will be on the application of this principle to the GIT construction of the moduli space of stable curves, leading to moduli spaces of curves of fixed singularity type.
 

Hash Proof Systems or Smooth Projective Hash Functions (SPHFs) are a
form of implicit arguments introduced by Cramer and Shoup at
Eurocrypt’02. They have found many applications since then, in
particular for authenticated key exchange or honest-verifier
zero-knowledge proofs. While they are relatively well understood in
group settings, they seem painful to construct directly in the lattice
setting.
Only one construction of an SPHF over lattices has been proposed, by
Katz and Vaikuntanathan at Asiacrypt’09. But this construction has an
important drawback: it only works for an ad-hoc language of ciphertexts.
Concretely, the corresponding decryption procedure needs to be tweaked,
now requiring q many trapdoor inversion attempts, where q is the modulus
of the underlying Learning With Error (LWE) problem.
Using harmonic analysis, we explain the source of this limitation, and
propose a way around it. We show how to construct SPHFs for standard
languages of LWE ciphertexts, and explicit our construction over a
tag-CCA2 encryption scheme à la Micciancio-Peikert (Eurocrypt’12).

If there is enough time, we will conclude with applications of these
SPHFs to password-authenticated key exchange, honest-verifier
zero-knowledge and a variant of witness encryption.

There are many natural questions one can ask about presentations of finite groups- for instance, given two presentations of the same group with the same number of generators, must the number of relations also be equal? This question, and closely related ones, are unsolved. However if one asks the same question in the category of profinite groups, surprisingly strong properties hold- including a positive answer to the above question. I will make this statement precise and give the proof of this and similar results due to Alex Lubotzky.

Lagrangian Floer cohomology groups are extremely hard compute in most situations. In this talk I’ll describe two ways to extract information about the self-Floer cohomology of a monotone Lagrangian possessing certain kinds of symmetry, based on the closed-open string map and the Oh spectral sequence. The focus will be on a particular family of examples, where the techniques can be combined to deduce some unusual properties.

A central theorem in combinatorics is Sperner’s Theorem, which determines the maximum size of a family in the Boolean lattice that does not contain a 2-chain. Erdos later extended this result and determined the largest family not containing a k-chain. Erdos and Katona and later Kleitman asked how many such chains must appear in families whose size is larger than the corresponding extremal result.

This question was resolved for 2-chains by Kleitman in 1966, who showed that amongst families of size M in the Boolean lattice, the number of 2-chains is minimized by a family whose sets are taken as close to the middle layer as possible. He also conjectured that the same conclusion should hold for all k, not just 2. The best result on this question is due to Das, Gan and Sudakov who showed roughly that Kleitman’s conjecture holds for families whose size is at most the size of the k+1 middle layers of the Boolean lattice. Our main result is that for every fixed k and epsilon, if n is sufficiently large then Kleitman’s conjecture holds for families of size at most (1-epsilon)2^n, thereby establishing Kleitman’s conjecture asymptotically (in a sense). Our proof is based on ideas of Kleitman and Das, Gan and Sudakov.

Joint work with Jozsef Balogh.

We present some dimensionality reduction techniques for global optimization algorithms, in order to increase their scalability. Inspired by ideas in machine learning, and extending the approach of random projections in Zhang et al (2016), we present some new algorithmic approaches for global optimisation with theoretical guarantees of good behaviour and encouraging numerical results.
 

Derivative-free optimisation (DFO) algorithms are a category of optimisation methods for situations when one is unable to compute or estimate derivatives of the objective, such as when the objective has noise or is very expensive to evaluate. In this talk I will present a flexible DFO framework for unconstrained nonlinear least-squares problems, and in particular discuss its performance on noisy problems.

In this talk we consider the limiting behaviour of the strong solution of the Navier--Stokes equation as the viscosity goes to zero, on a three--dimensional region with curved boundary. Under the Navier and kinematic boundary conditions, we show that the solution converges to that of the Euler equation (in suitable topologies). The proof is based on energy estimates and differential--geometric considerations. This is a joint work with Profs. Gui-Qiang Chen and Zhongmin Qian, both at Oxford. 

Some recent applications of supertwistors to superparticle mechanics will be reviewed.
First: Supertwistors allow a simple quantization of the  N-extended 4D massless superparticle, and peculiarities of massless 4D supermultiplets can then be explained by considering the quantum fate of a classical ``worldline CPT'' symmetry. For N=1 there is a global CPT anomaly, which explains why there is no CPT self-conjugate supermultiplet. For N=2 there is no anomaly but a Kramers degeneracy explains the doubling of states in the CPT self-conjugate hypermultiplet.
Second: the bi-supertwistor formulation of the N-extended massive superparticle in 3D, 4D and 6D makes manifest a ``hidden’’ 2N-extended supersymmetry. It also has a simple expression in terms of hermitian 2x2 matrices over the associative division algebras R,C,H.
Third: omission of the mass-shell constraint in this 3D,4D,6D bi-supertwistor action yields, as suggested  by holography, the action for a supergraviton in 4D,5D,7D AdS. Application to the near horizon AdSxS geometries of the M2,D3 and M5 brane confirms that the graviton supermultiplet has 128+128 polarisation states. 

I will report some recent analytical results on microstructures in low-hysteresis shape memory alloys. The modelling assumption is that the width of the thermal hysteresis is closely related to the minimal energy that is necessary to build a martensitic nucleus in an austenitic matrix. This energy barrier is typically modeled by (singularly perturbed) nonconvex elasticity functionals. In this talk, I will discuss recent results on the resulting variational problems, including stress-free inclusions and microstructures in the case of almost compatible phases. This talk is partly based on joint works with S. Conti, J. Diermeier, M. Klar, and D. Melching.

The theory of connections on curves and Hitchin systems is something like a “global theory of Lie groups”, where one works over a Riemann surface rather than just at a point. We’ll describe how one can take this analogy a few steps further by attempting to make precise the class of rich geometric objects that appear in this story (including the non-compact case), and discuss their classification, outlining a theory of “Dynkin diagrams” as a step towards classifying some examples of such objects.

Erik Panzer

Feynman integrals, graph polynomials and zeta values

Where do particle physicists, algebraic geometers and number theorists meet?

Feynman integrals compute how elementary particles interact and they are fundamental for our understanding of collider experiments. At the same time, they provide a rich family of special functions that are defined as period integrals, including special values of certain L functions.

In the talk I will give the definition of Feynman integrals via graph polynomials and discuss some examples that evaluate to values of the Riemann zeta function. Then I will discuss some of the interesting questions in this field and mention some of the techniques that are used to study these.

[[{"fid":"47855","view_mode":"media_square","fields":{"format":"media_square","field_file_image_alt_text[und][0][value]":"Yuji Nakatsukasa","field_file_image_title_text[und][0][value]":"Yuji Nakatsukasa"},"type":"media","attributes":{"alt":"Yuji Nakatsukasa","title":"Yuji Nakatsukasa","height":"258","width":"258","class":"media-element file-media-square"}}]]

Yuji Nakatsukasa

Computing matrix eigenvalues

The numerical linear algebra community solves two main problems: linear systems, and eigenvalue problems. They are both vastly important; it would not be too far-fetched to say that most (continuous) problems in scientific computing eventually boil down to one or both of these.

This talk focuses on eigenvalue problems. I will first describe some of their applications, such as Google's PageRank, PCA, finding zeros and poles of functions, and global optimization. I will then turn to algorithms for computing eigenvalues, namely the classical QR algorithm---which is still the basis for state-of-the-art. I will emphasize that the underlying mathematics is (together with the power method and numerical stability analysis) rational approximation theory.