Past

Form factors form a bridge between the purely on-shell amplitudes and the purely off-shell correlation functions. In this talk, we study the form factors of general gauge-invariant local composite operators in N=4 SYM theory via on-shell methods. At tree-level and for a minimalnumber of external fields, the form factor exactly realises the spin-chain picture of N=4 SYM theory in the language of scattering amplitudes. Via generalised unitarity, we obtain the cut-constructible part of the one-loop correction to the minimal form factor of a generic operator. Its UV divergence yields the complete one-loop dilatation operator of the theory. At two-loop order, we employ unitarity to calculate the minimal form factors and thereby the dilatation operator for the Konishi primary operator and all operators in the SU(2) sector. For the former operator as well as other non-protected operators, important subtleties arise which require an extension of the method of unitarity.

We will discuss 2d Euler and Boussinesq (incompressible) flows related to a possible boundary blow-up scenario for the 3d axi-symmetric case suggested by G. Luo and T. Hou, together with some easier model problems relevant for that situation.

Classically, basin modelling is undertaken with very little a priori knowledge. Alongside the challenge of improving the general fidelity and utility of the modelling systems, is the challenge of constraining these systems with unknowns and uncertainties in such a way that models (and derived simulation results) can be readily regenerated/reevaluated in the light of new empirical data obtained during the course of exploration, development and production activities.

A result of Jeffrey Brock states that, given a hyperbolic 3-manifold which is a mapping torus over a surface $S$, its volume can be expressed in terms of the distance induced by the monodromy map in the pants graph of $S$. This is an abstract graph whose vertices are pants decompositions of $S$, and edges correspond to some 'elementary alterations' of those.
I will show how this theorem gives an estimate for the volume of hyperbolic complements of closed braids in the solid torus, in terms of braid properties. The core piece of such estimate is a generalization of a result of Masur, Mosher and Schleimer that train track splitting sequences (which I will define in the talk) induce quasi-geodesics in the marking graph.

In this talk, we aim to provide a valuation framework for counterparty credit risk based on a structural default model which incorporates jumps and dependence between the assets of interest. In this framework default is caused by the firm value falling below a prespecified threshold following unforeseeable shocks, which deteriorate its liquidity and ability to meet its liabilities. The presence of dependence between names captures wrong-way risk and right-way risk effects. The structural model traces back to Merton (1974), who considered only the possibility of default occurring at the maturity of the contract; first passage time models starting from the seminal contribution of Black and Cox (1976) extend the original framework to incorporate default events at any time during the lifetime of the contract. However, as the driving risk process used is the Brownian motion, all these models suffers of vanishing credit spreads over the short period - a feature not observed in reality. As a consequence, the Credit Value Adjustment (CVA) would be underestimated for short term deals as well as the so-called gap risk, i.e. the unpredictable loss due to a jump event in the market. Improvements aimed at resolving this issue include for example random default barriers, time dependent volatilities, and jumps. In this contribution, we adopt Lévy processes and capture dependence via a linear combination of two independent Lévy processes representing respectively the systematic risk factor and the idiosyncratic shock. We then apply this framework to the valuation of CVA and DVA related to equity contracts such as forwards and swaps. The main focus is on the impact of correlation between entities on the value of CVA and DVA, with particular attention to wrong-way risk and right-way risk, the inclusion of mitigating clauses such as netting and collateral, and finally the impact of gap risk. Particular attention is also devoted to model calibration to market data, and development of adequate numerical methods for the complexity of the model considered.

 Let $X$ be a smooth cubic hypersurface of dimension $m$ defined over a global field $K$. A conjecture of Colliot-Thelene(02) states that $X$ satisfies the Hasse Principle and Weak approximation as long as $m\geq 3$. We use a global version of Hardy-Littlewood circle method along with the theory of global $L$-functions to establish this for $m\geq 6$, in the case $K=\mathbb{F}_q(t)$, where $\text{char}(\mathbb{F}_{q})> 3$.

In this seminar I will present a semi-langrangian discretisation of the Monge-Ampère operator, which is of interest in optimal transport 
and differential geometry as well as in related fields of application.

I will discuss the proof of convergence to viscosity solutions. To address the challenge of uniqueness and convexity we draw upon the classical relationship with Hamilton-Jacobi-Bellman equations, which we extend to the viscosity setting. I will explain that the monotonicity of semi-langrangian schemes implies that they possess large stencils, which in turn requires careful treatment of the boundary conditions.

The contents of the seminar is based on current work with X Feng from the University of Tennessee.

Joint work with Anders Hansen (Cambridge), Olavi Nevalinna (Aalto) and Markus Seidel (Zwickau).             

Expansion, rank gradient and virtual splitting are all concepts of great interest in asymptotic group theory. We discuss a result of Marc Lackenby which demonstrates a surprising relationship between then, and give examples exhibiting different combinations of asymptotic behaviour.

When the Computing Laboratory discarded its hardcopy journals around 2008, I kept the first ten years or so of each of six classic numerical analysis journals, starting from volume 1, number 1.  This will not be a seminar in the usual sense but a mutual exploration.  Come prepared to look through a few of these old volumes yourself and perhaps to tell the group of something interesting you find.  Bring a pen and paper.  All are welcome.

Mathematics of Computation, from 1943
SIAM Journal, from 1953
Numerische Mathematik, from 1959
BIT, from 1961
SIAM Journal on Numerical Analysis, from 1964
Journal of the IMA, from 1965

We look at the construction of radial metrics with an isolated singularity for the constant fractional curvature equation. This is a semilinear, non-local equation involving the fractional Laplacian, and appears naturally in conformal geometry. 

I will review Bott's classical periodicity result about topological K-theory (with period 2 in the case of complex K-theory, and period 8 in the case of real K-theory), and provide an easy sketch of proof, based on the algebraic periodicity of Clifford algebras. I will then introduce the `higher real K-theory' of Hopkins and Miller, also known as TMF. I'll discuss its periodicity (with period 576), and present a conjecture about a corresponding algebraic periodicity of `higher Clifford algebras'. Finally, applications to physics will be discussed.

The role of surface-water flooding in controlling fluxes of water and carbon between the land and the atmosphere is increasingly recognized in studies of the Earth system. Simultaneous advances in remote earth observation and large-scale land-surface and hydrological modeling promise improvements in our ability to understand these linkages, and suggest that improvements in prediction of river flow and inundation extents may result. Here we present an analysis of newly-available observational estimates of surface water inundation obtained through satellite Earth observation with results from simulations produced by using the Joint UK Land Environment Simulator (JULES) land-surface model operating at 0.5 degree resolution over the African continent. The model was forced with meteorological input from the WATCH Forcing Data for the period 1981-2001 and sensitivity to various model configurations and parameter settings were tested. Both the PDM and TOPMODEL sub-grid scale runoff generation schemes were tested for parameter sensitivities, with the evaluation focussing on simulated river discharge in sub-catchments of the Congo, Nile, Niger, Orange, Okavango and Zambezi rivers. It was found that whilst the water balance in each of the catchments can be simulated with acceptable accuracy, the individual responses of each river vary between model configurations so that there is no single runoff parameterization scheme or parameter values that yields optimal results across all catchments. We trace these differences to the model’s representation of sub-surface flow and make some suggestions to improve the performance of large-scale land-surface models for use in similar applications. Our findings also demonstrate links between episodes of extensive surface water flooding and large-scale climatic indices, although the pattern of correlations contains a level of spatial and temporal detail that warrants careful attention to the climatology of individual situations. These findings suggest that the use of Earth observation data together with improved models of large-scale hydrology have the potential to improve our ability to predict surface-water flooding and to develop our understanding of the role of flooding in driving components of the water and carbon cycles.

Sudden cardiac arrhythmic death remains a major health challenge in Western Society. Recent advances in computational methods and technologies have made clinically-based cardiac modelling a reality. An important current focus is the use of modelling to understand the nature of arrhythmias in the setting of different forms of structural heart disease. However, many challenges remain regarding the best use of these models to inform clinical decision making and guide therapies. In this talk, I will introduce a diverse sample of applications of modelling in this context, ranging from basic science studies which aim to leverage a fundamental mechanistic understanding of different aspects of pathological cardiac function, to direct clinical-application projects which aim to use modelling to immediately inform a clinical therapy. I will also discuss the challenges involved in clinically-driven modelling, and how to both engage, and manage, the expectations of clinicians at the same time, particularly with respect to the potential uses of 'patient-specific' modelling.

In this talk we're going to discuss Hamilton's maximum principle for the Ricci flow. As an application, I would like to explain a technique due to Boehm and Wilking which provides a general tool to obtain new Ricci flow invariant curvature conditions from given ones. As we'll see, it plays a key role in Brendle and Schoen's proof of the differentiable sphere theorem.

We consider the problem of unveiling the implicit network structure of user interactions in a social network, based only on high-frequency timestamps. Our inference is based on the minimization of the least-squares loss associated with a multivariate Hawkes model, penalized by $\ell_1$ and trace norms. We provide a first theoretical analysis of the generalization error for this problem, that includes sparsity and low-rank inducing priors. This result involves a new data-driven concentration inequality for matrix martingales in continuous time with observable variance, which is a result of independent interest. The analysis is based on a new supermartingale property of the trace exponential, based on tools from stochastic calculus. A consequence of our analysis is the construction of sharply tuned $\ell_1$ and trace-norm penalizations, that leads to a data-driven scaling of the variability of information available for each users. Numerical experiments illustrate the strong improvements achieved by the use of such data-driven penalizations.

Classical anabelian geometry shows that for hyperbolic curves the etale fundamental group encodes the curve provided the base field is sufficiently arithmetic. In higher dimensions it is natural to replace the etale fundamental group by the etale homotopy type. We will report on progress obtained in this direction in a recent joint work with Alexander Schmidt.

**Joint seminar with Logic. 

Classical anabelian geometry shows that for hyperbolic curves the etale fundamental group encodes the curve provided the base field is sufficiently arithmetic. In higher dimensions it is natural to replace the etale fundamental group by the etale homotopy type. We will report on progress obtained in this direction in a recent joint work with Alexander Schmidt.

**Joint seminar with Number Theory. Note unusual time and place**

I will present a survey of the main results about first and second order models of swarming where repulsion and attraction are modeled through pairwise potentials. We will mainly focus on the stability of the fascinating patterns that you get by random data particle simulations, flocks and mills, and their qualitative behavior.
 

The Singular Value Decomposition (SVD) of matrices and the related Principal Components Analysis (PCA) express a matrix in terms of singular vectors, which are linear combinations of all the input data and lack an intuitive physical interpretation. Motivated by the application of PCA and SVD in the analysis of populations genetics data, we will discuss the notion of leverage scores: a simple statistic that reveals columns/rows of a matrix that lie in the subspace spanned by the top principal components (left/right singular vectors). We will then use the leverage scores to present matrix decompositions that express the structure in a matrix in terms of actual columns (and/or rows) of the matrix. Such decompositions are easier to interpret in applications, since the selected columns and rows are subsets of the data. We will also discuss extensions of the leverage scores to reveal influential entries of a matrix.

I will present two recent results concerning the stability of boundary layer asymptotic expansions of solutions of Navier-Stokes with small viscosity. First, we show that the linearization around an arbitrary stationary shear flow admits an unstable eigenfunction with small wave number, when viscosity is sufficiently small. In boundary-layer variables, this yields an exponentially growing sublayer near the boundary and hence instability of the asymptotic expansions, within an arbitrarily small time, in the inviscid limit. On the other hand, we show that the Prandtl asymptotic expansions hold for certain steady flows. Our proof involves delicate construction of approximate solutions (linearized Euler and Prandtl layers) and an introduction of a new positivity estimate for steady Navier-Stokes. This in particular establishes the inviscid limit of steady flows with prescribed boundary data up to order of square root of small viscosity. This is a joint work with Emmanuel Grenier and Yan Guo.

In this talk I will try to show how certain asymptotic properties of a random walk on a graph are related to geometric properties of the graph itself. A special focus will be put on spectral properties and isoperimetric inequalities, proving Kesten's criterion for amenability.

Given a vector space V over a field K, let End(V) denote the algebra of linear endomorphisms of V. If V is finite-dimensional, then it is well-known that the diagonalizable subalgebras of End(V) are characterized by their internal algebraic structure: they are the subalgebras isomorphic to K^n for some natural number n. 

In case V is infinite dimensional, the diagonalizable subalgebras of End(V) cannot be characterized purely by their internal algebraic structure: one can find diagonalizable and non-diagonalizable subalgebras that are isomorphic.  I will explain how to characterize the diagonalizable subalgebras of End(V) as topological algebras, using a natural topology inherited from End(V).  I will also illustrate how this characterization relates to an infinite-dimensional Wedderburn-Artin theorem that characterizes "topologically semisimple" algebras.

In recent years, several preconditioning strategies have been proposed for control problems in fluid dynamics. These are a special case of the general saddle point problem in optimisation. Here, we will extend a preconditionier for distributed Stokes control problems, developed by Rees and Wathen, to the case of boundary control. We will show the usefulness of low-rank structures in constructing a good approximation for the Schur complement of the saddle point matrix. In the end, we will discuss the applicability of this strategy for Navier-Stokes control.

We develop a spectral method for solving univariate singular integral equations over unions of intervals and circles, by utilizing Chebyshev, ultraspherical and Laurent polynomials to reformulate the equations as banded infinite-dimensional systems. Low rank approximations are used to obtain compressed representations of the bivariate kernels. The resulting system can be solved in linear time using an adaptive QR factorization, determining an optimal number of unknowns needed to resolve the solution to any pre-determined accuracy. Applications considered include fracture mechanics, the Faraday cage, and acoustic scattering. The Julia software package https://github.com/ApproxFun/SIE.jl implements our method with a convenient, user-friendly interface.

In the talk we present a survey of recent results (see [4]-[6]) on the existence theorems for the steady-state Navier-Stokes boundary value problems in the plane and axially symmetric 3D cases for bounded and exterior domains (the so called Leray problem, inspired by the classical paper [8]). One of the main tools is the Morse-Sard Theorem for the Sobolev functions $f\in W^2_1(\mathbb R^2)$ [1] (see also [2]-[3] for the multidimensional case). This theorem guaranties that almost all level lines of such functions are $C^1$-curves besides the function $f$ itself could be not $C^1$-regular.

Also we discuss the recent Liouville type theorem for the steady-state Navier-Stokes equations for  axially symmetric 3D solutions in the absence of swirl (see [1]).

References

1.  Bourgain J., Korobkov M. V., Kristensen J., On the Morse-Sard property and level sets of Sobolev and BV functions, Rev. Mat. Iberoam.,  29 , No. 1, 1-23  (2013).
2. Bourgain J., Korobkov M. V., Kristensen J., On the Morse-Sard property and level sets of $W^{n,1}$ Sobolev functions on $\mathbb R^n$, Journal fur die reine und angewandte Mathematik (Crelles Journal) (Online first 2013).
3. Korobkov M. V., Kristensen J., On the Morse-Sard Theorem for the sharp case of Sobolev mappings, Indiana Univ. Math. J., 63, No. 6, 1703-1724  (2014).
4. Korobkov M. V., Pileckas K., Russo R., The existence theorem for steady Navier-Stokes equations in the axially symmetric case, Ann. Sc. Norm. Super. Pisa Cl. Sci. (5), 14, No. 1, 233-262  (2015).
5. Korobkov M. V., Pileckas K., Russo R., Solution of Leray's problem for stationary Navier-Stokes equations in plane and axially symmetric spatial domains,  Ann. of Math., 181, No. 2, 769-807  (2015).
6. Korobkov M. V., Pileckas K., Russo R., The existence theorem for the steady Navier-Stokes problem in exterior axially symmetric 3D domains, 2014, 75 pp., http://arXiv.org/abs/1403.6921.
7. Korobkov M. V., Pileckas K., Russo R., The Liouville Theorem for the Steady-State Navier-Stokes Problem for Axially Symmetric 3D Solutions in Absence of Swirl, J. Math. Fluid Mech. (Online first 2015).
8. Leray J., Étude de diverses équations intégrals nonlinéaires et de quelques problèmes que pose l'hydrodynamique, J. Math. Pures Appl., 9, No. 12, 1- 82 (1933).

After some generalities on étale fundamental groups and anabelian geometry, I will explore some of the current results on the section conjecture, including those of Koenigsmann and Pop on the birational section conjecture, and a recent unpublished result of Mohamed Saidi which reduces the section conjecture for finitely generated fields over the rationals to the case of number fields.

Erdos and Renyi introduced a model for studying random graphs of a given "density" and proved that there is a sharp threshold at which lower density random graphs are disconnected and higher density ones are connected.  Motivated by ideas in geometric group theory we will explain some new threshold theorems we have discovered for random graphs.  We will then, explain applications of these results to the geometry of Coxeter groups.  Some of this talk will be on joint work with Hagen and Sisto; other parts are joint work with Hagen, Susse, and Falgas-Ravry.

This talk investigates the discovery of an intriguing and fundamental connection between the famous but apparently unrelated work of two mathematicians of late antiquity, Pappus and Diophantus. This link went unnoticed for well over 1500 years until the publication of two groundbreaking but again ostensibly unrelated works by two German mathematicians at the close of the 19th century. In the interim, mathematics changed out of all recognition, with the creation of numerous new mathematical subjects and disciplines, without which the connection might never have been noticed in the first place. This talk examines the chain of mathematical events that led to the discovery of this remarkable link between two seemingly distinct areas of mathematics, encompassing number theory, finite-dimensional real normed algebras, combinatorial design theory, and projective geometry, and including contributions from mathematicians of all kinds, from the most distinguished to the relatively unknown.

Adrian Rice is Professor of Mathematics at Randolph-Macon College in Ashland, Virginia, where his research focuses on the history of 19th- and early 20th-century mathematics. He is a three-time recipient of the Mathematical Association of America's awards for outstanding expository writing.

There is a pleasing correspondence between splittings of a free group over finitely generated subgroups and systems of surfaces in a doubled handlebody. One can use this to describe a family of hyperbolic complexes on which Out(F_n) acts. This is joint work with Camille Horbez.

Two subsets A and B of R^n are equidecomposable if it is possible to partition A into pieces and rearrange them via isometries to form a partition of B. Motivated by what is nowadays known as Banach-Tarski paradox, Tarski asked if the unit square and the disc of unit area in R^2 are equidecomposable. 65 years later Laczkovich showed that they are, at least when the pieces are allowed to be non-measurable sets. I will talk about a joint work with A. Mathe and O. Pikhurko which implies in particular the existence of a measurable equidecomposition of circle and square in R^2.

I this talk I will try to give an overview of recent progress in
spatial stochastic modeling within the reaction-diffusion
framework. While much of the initial motivation for this work came
from problems in cell biology, I will also highlight some examples
from epidemics and neuroscience.

As a motivating introduction, some newly discovered properties of
optimal controls in stochastic enzymatic reaction networks will be
presented. I will next detail how diffusive and subdiffusive reactive
processes in realistic geometries at the cellular scale may be modeled
mesoscopically. Along the way, some different means by which these
models may be analyzed with respect to consistency and convergence
will also be discussed. These analytical techniques hint at how
effective (i.e. parallel) numerical implementations can be
designed. Large-scale simulations will serve as illustrations.

Divergence, thickness, and relative hyperbolicity are three geometric properties which determine aspects of the quasi-isometric geometry of a finitely generated group. We will discuss the basic properties of these notions and some of the relations between them. We will then then survey how these properties manifest in right-angled Coxeter groups and detail various ways to classify Coxeter groups using them.

This is joint work with Hagen and Sisto.

Standard commutative algebra is based on the notions of commutative monoid, Abelian group and commutative ring. In recent years, motivations from category theory, algebraic geometry, and mathematical logic led to the development of an area that may be called commutative 2-algebra, in which the notions used in commutative algebra are replaced by their category-theoretic counterparts (e.g. commutative monoids are replaced by  symmetric monoidal categories). The aim of this talk is to explain the analogy between standard commutative algebra and commutative 2-algebra, and to outline how this suggests counterparts of basic aspects of algebraic geometry. In particular, I will describe some joint work with Andre’ Joyal on operads and analytic functors in this context.

Stochastic optimization for sequential decision problems under uncertainty arises in many settings, and as a result as evolved under several canonical frameworks with names such as dynamic programming, stochastic programming, optimal control, robust optimization, and simulation optimization (to name a few).  This is in sharp contrast with the universally accepted canonical frameworks for deterministic math programming (or deterministic optimal control).  We have found that these competing frameworks are actually hiding different classes of policies to solve a single problem which encompasses all of these fields.  In this talk, I provide a canonical framework which, while familiar to some, is not universally used, but should be.  The framework involves solving an objective function which requires searching over a class of policies, a step that can seem like mathematical hand waving.  We then identify four fundamental classes of policies, called policy function approximations (PFAs), cost function approximations (CFAs), policies based on value function approximations (VFAs), and lookahead policies (which themselves come in different flavors).  With the exception of CFAs, these policies have been widely studied under names that make it seem as if they are fundamentally different approaches (policy search, approximate dynamic programming or reinforcement learning, model predictive control, stochastic programming and robust optimization).  We use a simple energy storage problem to demonstrate that minor changes in the nature of the data can produce problems where each of the four classes might work best, or a hybrid.  This exercise supports our claim that any formulation of a sequential decision problem should start with a recognition that we need to search over a space of policies.

I will discuss some recent results on the distribution of the real-analytic Eisenstein series on thin sets, such as a geodesic segment. These investigations are related to mean values of the Riemann zeta function, and have connections to quantum chaos.

Despite many years of intensive research, the modeling of contact lines moving by spreading and/or evaporation still remains a subject of debate nowadays, even for the simplest case of a pure liquid on a smooth and homogeneous horizontal substrate. In addition to the inherent complexity of the topic (singularities, micro-macro matching, intricate coupling of many physical effects, …), this also stems from the relatively limited number of studies directly comparing theoretical and experimental results, with as few fitting parameters as possible. In this presentation, I will address various related questions, focusing on the physics invoked to regularize singularities at the microscale, and discussing the impact this has at the macroscale. Two opposite “minimalist” theories will be detailed: i) a classical paradigm, based on the disjoining pressure in combination with the spreading coefficient; ii) a new approach, invoking evaporation/condensation in combination with the Kelvin effect (dependence of saturation conditions upon interfacial curvature). Most notably, the latter effect enables resolving both viscous and thermal singularities altogether, without needing any other regularizing effects such as disjoining pressure, precursor films or slip length. Experimental results are also presented about evaporation-induced contact angles, to partly validate the first approach, although it is argued that reality might often lie in between these two extreme cases.

We present a trust region algorithm for solving nonconvex optimization problems that, in the worst-case, is able to drive the norm of the gradient of the objective below a prescribed threshold $\epsilon > 0$ after at most ${\cal O}(\epsilon^{-3/2})$ function evaluations, gradient evaluations, or iterations.  Our work has been inspired by the recently proposed Adaptive Regularisation framework using Cubics (i.e., the ARC algorithm), which attains the same worst-case complexity bound.  Our algorithm is modeled after a traditional trust region algorithm, but employs modified step acceptance criteria and a novel trust region updating mechanism that allows it to achieve this desirable property.  Importantly, our method also maintains standard global and fast local convergence guarantees.