Past

A bit more than ten years ago, Peter Oszváth and Zoltán Szabó defined Heegaard-Floer homology, a gauge theory inspired invariant of three-manifolds that is designed to be more computable than its cousins, the Donaldson and Seiberg-Witten invariants for four-manifolds. This invariant is defined in terms of a Heegaard splitting of the three-manifold. In this talk I will show how Heegaard-Floer homology is defined (modulo the analysis that goes into it) and explain some of the directions in which people have taken this theory, such as knot theory and fitting Heegaard-Floer homology into the scheme of topological field theories.

A large class of links in $S^3$ has the property that the complement admits a complete hyperbolic metric of finite volume. But is this volume understandable from the link itself, or maybe from some nice diagram of it? Marc Lackenby in the early 2000s gave a positive answer for a class of diagrams, the alternating ones. The proof of this result involves an analysis of the JSJ decomposition of the link complement: in particular of how does it appear on the link diagram. I will tell you an outline of this proof, forgetting its most technical aspects and explaining the underlying ideas in an accessible way.

I will review several known problems on the automorphism group of finite $p$-groups and present a sketch of the proof of the the following result obtained jointly with Jon Gonz\'alez-S\'anchez:

For each prime $p$ we construct a family $\{G_i\}$ of finite $p$-groups such that $|Aut (G_i)|/|G_i|$ goes to $0$, as $i$ goes to infinity. This disproves a well-known conjecture that $|G|$ divides $|Aut(G)|$ for every non-abelian finite $p$-group $G$.

The Contou-Carrère symbol has been introduced in the 90's in the study of local analogues of autoduality of Jacobians of smooth projective curves. It is closely related to the tame symbol, the residue pairing, and the canonical central extension of loop groups. In this talk we will a discuss a K-theoretic interpretation of the Contou-Carrère symbol, which allows us to generalize this one-dimensional picture to higher dimensions. This will be achieved by studying the K-theory of Tate objects, giving rise to natural central extensions of higher loop groups by spectra. Using the K-theoretic viewpoint, we then go on to prove a reciprocity law for higher-dimensional Contou-Carrère symbols. This is joint work with O. Braunling and J. Wolfson.

Crouzeix's conjecture is an exasperating problem of linear algebra that has been open since 2004: the norm of p(A) is bounded by twice the maximum value of p on the field of values of A, where A is a square matrix and p is a polynomial (or more generally an analytic function).  I'll say a few words about the conjecture and
show the beautiful proof of Pearcy in 1966 of a special case, based on a vector-valued barycentric interpolation formula.

The Tutte polynomial of a graph $G$ is a two-variable polynomial $T(G;x,y)$, which encodes much information about~$G$. The number of spanning trees in~$G$, the number of acyclic orientations of~$G$, and the partition function of the $q$-state Potts model are all specialisations of the Tutte polynomial. Jackson and Sokal have studied the sign of the Tutte polynomial, and identified regions in the $(x,y)$-plane where it is ``essentially determined'', in the sense that the sign is a function of very simple characteristics of $G$, e.g., the number of vertices and connected components of~$G$. It is natural to ask whether the sign of the Tutte polynomial is hard to compute outside of the regions where it is essentially determined. We show that the answer to this question is often an emphatic ``yes'': specifically, that determining the sign is \#P-hard. In such cases, approximating the Tutte polynomial with small relative error is also \#P-hard, since in particular the sign must be determined. In the other direction, we can ask whether the Tutte polynomial is easy to approximate in regions where the sign is essentially determined. The answer is not straightforward, but there is evidence that it often ``no''. This is joint work with Leslie Ann Goldberg (Oxford).

I will explain some ongoing work on understanding algebraic D-moldules via their reduction to positive characteristic. I will define the p-cycle of an algebraic D-module, explain the general results of Bitoun and Van Den Bergh; and then discuss a new construction of a class of algebraic D-modules with prescribed p-cycle.

Data assimilation is a particular form of state estimation. That's partly the "what". We'll also look at the how's, the why's, some who's and some where's.

The talk will recall the results of three preprints, first two authored by my former student Mickael Launay, and the final coauthored by Mickael and myself. All three works are available on arXiv. At this point it is not clear that they will ever get published (or submitted for review) but hopefully this does not make their contents less interesting. This class of interacting urn processes was introduced in Launay's thesis, in an attempt to model more realistically the memory sharing that occurs in food trail pheromone marking or in similar collective learning phenomena. An interesting critical behavior occurs already in the case of exponential reinforcement. No prior knowledge of strong urns will be assumed, and I will try to explain the reason behind the phase transition.

The coalescing Brownian flow on $\R$ is a process which was introduced by Arratia (1979) and Toth and Werner (1997), and which formally corresponds to starting coalescing Brownian motions from every space-time point. We provide a new state space and topology for this process and obtain an invariance principle for coalescing random walks. The invariance principle holds under a finite variance assumption and is thus optimal. In a series of previous works, this question was studied under a different topology, and a moment of order $3-\eps$ was necessary for the convergence to hold. Our proof relies crucially on recent work of Schramm and Smirnov on scaling limits of critical percolation in the plane. Our approach is sufficiently simple that we can handle substantially more complicated coalescing flows with little extra work -- in particular similar results are obtained in the case of coalescing Brownian motions on the Sierpinski gasket. This is the first such result where the limiting paths do not enjoy the non-crossing property.

Joint work with Christophe Garban (Lyon) and Arnab Sen (Minnesota).

This is the first of a series of talks based on Gary 
Gruenhage's 'A survey of D-spaces' [1]. A space is D if for every 
neighbourhood assignment we can choose a closed discrete set of points 
whose assigned neighbourhoods cover the space. The mention of 
neighbourhood assignments and a topological notion of smallness (that 
is, of being closed and discrete) is peculiar among covering properties. 
Despite being introduced in the 70's, we still don't know whether a 
Lindelöf or a paracompact space must be D. In this talk, we will examine 
some elementary properties of this class via extent and Lindelöf numbers.

I will explain a new formulation of Einstein’s equations in 4-dimensions using the language of gauge theory. This was also discovered independently, and with advances, by Kirill Krasnov. I will discuss the advantages and disadvantages of this new point of view over the traditional "Einstein-Hilbert" description of Einstein manifolds. In particular, it leads to natural "sphere conjectures" and also suggests ways to find new Einstein 4-manifolds. I will describe some first steps in these directions. Time permitting, I will explain how this set-up can also be seen via 6-dimensional symplectic topology and the additional benefits that brings.

I will discuss two topics. Firstly, coupling of the circadian clock and cell cycle in mammalian cells. Together with the labs of Franck Delaunay (Nice) and Bert van der Horst (Rotterdam) we have developed a pipeline involving experimental and mathematical tools that enables us to track through time the phase of the circadian clock and cell cycle in the same single cell and to extend this to whole lineages. We show that for mouse fibroblast cell cultures under natural conditions, the clock and cell cycle phase-lock in a 1:1 fashion. We show that certain perturbations knock this coupled system onto another periodic state, phase-locked but with a different winding number. We use this understanding to explain previous results. Thus our study unravels novel phase dynamics of 2 key mammalian biological oscillators. Secondly, I present a radical revision of the Nrf2 signalling system. Stress responsive signalling coordinated by Nrf2 provides an adaptive response for protection against toxic insults, oxidative stress and metabolic dysfunction. We discover that the system is an autonomous oscillator that regulates its target genes in a novel way.

Ax's theorem on the dimension of the intersection of an algebraic subvariety and a formal subgroup (Theorem 1F in "Some topics in differential algebraic geometry I...") implies Schanuel type transcendence results for a vast class of formal maps (including exp on a semi-abelian variety). Ax stated and proved this theorem in the characteristic 0 case, but the statement is meaningful for arbitrary characteristic and still implies positive characteristic transcendence results. I will discuss my work on positive characteristic version of Ax's theorem.

Motivated by the study of PDEs, we introduce the notion of a D-module on a variety X and give the basics of three perspectives on the theory: modules over the sheaf of differential operators on X; quasi-coherent modules with flat connection; and crystals on X. This talk will assume basic knowledge of algebraic geometry (such as rudimentary sheaf theory).

We discuss a simple variational principle for coherent material vortices

in two-dimensional turbulence. Vortex boundaries are sought as closed

stationary curves of the averaged Lagrangian strain. We find that

solutions to this problem are mathematically equivalent to photon spheres

around black holes in cosmology. The fluidic photon spheres satisfy

explicit differential equations whose outermost limit cycles are optimal

Lagrangian vortex boundaries. As an application, we uncover super-coherent

material eddies in the South Atlantic, which yield specific Lagrangian

transport estimates for Agulhas rings. We also describe briefly coherent

Lagrangian vortex detection to three-dimensional flows.

In this talk I will give a definition of cluster algebra and state some main results.

Moreover, I will explain how the combinatorics of certain cluster algebras can be modeled in geometric terms.

The accurate and stable numerical calculation of higher-order

derivatives of holomorphic functions (as required, e.g., in random matrix

theory to extract probabilities from a generating function) turns out to

be a surprisingly rich topic: there are connections to asymptotic analysis,

the theory of entire functions, and to algorithmic graph theory.

\textbf{James Newbury} \newline

Title: Heavy traffic diffusion approximation of the limit order book in a one-sided reduced-form model. \newline

Abstract: Motivated by a zero-intelligence approach, we try to capture the

dynamics of the best bid (or best ask) queue in a heavy traffic setting,

i.e when orders and cancellations are submitted at very high frequency.

We first prove the weak convergence of the discrete-space best bid/ask

queue to a jump-diffusion process. We then identify the limiting process

as a regenerative elastic Brownian motion with drift and random jumps to

the origin.

\newline

\textbf{Zhaoxu Hou} \newline

Title: Robust Framework In Finance: Martingale Optimal Transport and

Robust Hedging For Multiple Marginals In Continuous Time

\newline

Abstract: It is proved by Dolinsky and Soner that there is no duality

gap between the robust hedging of path-dependent European Options and a

martingale optimal problem for one marginal case. Motivated by their

work and Mykland's idea of adding a prediction set of paths (i.e.

super-replication of a contingent claim only required for paths falling

in the prediction set), we try to achieve the same type of duality

result in the setting of multiple marginals and a path constraint.

Working together with the Blue Brain Project at the EPFL, I'm trying to develop new topological methods for neural modelling. As a mathematician, however, I'm really motivated by how these questions in neuroscience can inspire new mathematics. I will introduce new work that I am doing, together with Kathryn Hess and Ran Levi, on brain plasticity and learning processes, and discuss some of the topological and geometric features that are appearing in our investigations.

I will look at the classical constructions that can be made using a straight edge and compass, I will then look at the limits of these constructions. I will then show how much further we can get with Origami, explaining how it is possible to trisect an angle or double a cube. Compasses not supplied.

Thoughts on the Burnside problem

Quasimaps provide compactifications, depending on a stability parameter epsilon, for moduli spaces of maps from nonsingular algebraic curves to a large class of GIT quotients. These compactifications enjoy good properties and in particular they carry virtual fundamental classes. As the parameter epsilon varies, the resulting invariants are related by wall-crossing formulas. I will present some of these formulas in genus zero, and will explain why they can be viewed as generalizations (in several directions) of Givental's toric mirror theorems. I will also describe extensions of wall-crossing to higher genus, and (time permitting) to orbifold GIT targets as well.
The talk is based on joint works with Bumsig Kim, and partly also with Daewoong Cheong and with Davesh Maulik.

Hessians of functionals of PDE solutions have important applications in PDE-constrained optimisation (Newton methods) and uncertainty quantification (for accelerating high-dimensional Bayesian inference).  With current techniques, a typical cost for one Hessian-vector product is 4-11 times the cost of the forward PDE solve: such high costs generally make their use in large-scale computations infeasible, as a Hessian solve or eigendecomposition would have costs of hundreds of PDE solves.

In this talk, we demonstrate that it is possible to exploit the common structure of the adjoint, tangent linear and second-order adjoint equations to greatly accelerate the computation of Hessian-vector products, by trading a large amount of computation for a large amount of storage. In some cases of practical interest, the cost of a Hessian-
vector product is reduced to a small fraction of the forward solve, making it feasible to employ sophisticated algorithms which depend on them.

Perfect matchings are fundamental objects of study in graph theory. There is a substantial classical theory, which cannot be directly generalised to hypergraphs unless P=NP, as it is NP-complete to determine whether a hypergraph has a perfect matching. On the other hand, the generalisation to hypergraphs is well-motivated, as many important problems can be recast in this framework, such as Ryser's conjecture on transversals in latin squares and the Erdos-Hanani conjecture on the existence of designs. We will discuss a characterisation of the perfect matching problem for uniform hypergraphs that satisfy certain density conditions (joint work with Richard Mycroft), and a polynomial time algorithm for determining whether such hypergraphs have a perfect matching (joint work with Fiachra Knox and Richard Mycroft).

Finding a sparse signal solution of an underdetermined linear system of measurements is commonly solved in compressed sensing by convexly relaxing the sparsity requirement with the help of the l1 norm. Here, we tackle instead the original nonsmooth nonconvex l0-problem formulation using projected gradient methods. Our interest is motivated by a recent surprising numerical find that despite the perceived global optimization challenge of the l0-formulation, these simple local methods when applied to it can be as effective as first-order methods for the convex l1-problem in terms of the degree of sparsity they can recover from similar levels of undersampled measurements. We attempt here to give an analytical justification in the language of asymptotic phase transitions for this observed behaviour when Gaussian measurement matrices are employed. Our approach involves novel convergence techniques that analyse the fixed points of the algorithm and an asymptotic probabilistic analysis of the convergence conditions that derives asymptotic bounds on the extreme singular values of combinatorially many submatrices of the Gaussian measurement matrix under matrix-signal independence assumptions.

This work is joint with Andrew Thompson (Duke University, USA).

Quasimaps provide compactifications, depending on a stability parameter epsilon, for moduli spaces of maps from nonsingular algebraic curves to a large class of GIT quotients. These compactifications enjoy good properties and in particular they carry virtual fundamental classes. As the parameter epsilon varies, the resulting invariants are related by wall-crossing formulas. I will present some of these formulas in genus zero, and will explain why they can be viewed as generalizations (in several directions) of Givental's toric mirror theorems. I will also describe extensions of wall-crossing to higher genus, and (time permitting) to orbifold GIT targets as well.
The talk is based on joint works with Bumsig Kim, and partly also with Daewoong Cheong and with Davesh Maulik.

Mixed motives turn up in number theory in various guises. Rather than discuss the rather deep foundational questions involved, this talk will aim

to give several illustrations of the ubiquity of mixed motives and their realizations. Along the way I hope to mention some of: the Mordell-Weil

theorem, the theory of height pairings, special values of L-functions, the Mahler measure of a polynomial, Galois deformations and the motivic

fundamental group.

We show that the positive mass theorem holds for

asymptotically flat, $n$-dimensional Riemannian manifolds with a metric

that is continuous, lies in the Sobolev space $W^{2, n/2}_{loc}$, and

has non-negative scalar curvature in the distributional sense. Our

approach requires an analysis of smooth approximations to the metric,

and a careful control of elliptic estimates for a related conformal

transformation problem. If the metric lies in $W^{2, p}_{loc}$ for

$p>n/2$, then we show that our metrics may be approximated locally

uniformly by smooth metrics with non-negative scalar curvature.

This talk is based on joint work with N. Tassotti and conversations with

J.J. Bevan.

With F. Johansson Viklund (Columbia) and A. Turner (Lancaster), we have studied a regularized version of the Hastings-Levitov model of random Laplacian growth. In addition to the usual feedback parameter $\alpha>0$, this regularized version of the growth process features a smoothing parameter $\sigma>0$.

We prove convergence of random clusters, in the limit as the size of the individual aggregating particles tends to zero, to deterministic limits, provided the smoothing parameter does not tend to zero too fast. We also study scalings limit of the harmonic measure flow on the boundary, and show that it can be described in terms of stopped Brownian webs on the circle. In contrast to the case $\alpha=0$, the flow does not always collapse into a single Brownian motion, which can be interpreted as a random number of infinite branches being present in the clusters.

Abstract: The boundary Harnack principle states that the ratio of any two functions, which are positive and harmonic on a domain, is bounded near some part of the boundary where both functions vanish. A given domain may or may not have this property, depending on the geometry of its boundary and the underlying metric measure space.

In this talk, we will consider a scale-invariant boundary Harnack principle on domains that are inner uniform. This has applications such as two-sided bounds on the Dirichlet heat kernel, or the identification of the Martin boundary and the topological boundary for bounded inner uniform domains.

The inner uniformity provides a large class of domains which may have very rough boundary as long as there are no cusps. Aikawa and Ancona proved the scale-invariant boundary Harnack principle on inner uniform domains in Euclidean space. Gyrya and Saloff-Coste gave a proof in the setting of non-fractal strictly local Dirichlet spaces that satisfy a parabolic Harnack inequality.

I will present a scale-invariant boundary Harnack principle for inner uniform domains in metric measure Dirichlet spaces that satisfy a parabolic Harnack inequality. This result applies to fractal spaces.

We analyse the impact of market makers' risk aversion on the equilibrium in a speculative market consisting of a risk neutral informed trader and noise traders. The unwillingness of market makers to bear risk causes the informed trader to absorb large shocks in their inventories. The informed trader's optimal strategy is to drive the market price to its fundamental value while disguising her trades as the ones of an uninformed strategic trader. This results in a mean reverting demand, price reversal, and systematic changes in the market depth. We also find that an increase in risk aversion leads to lower market depth, less efficient prices, stronger price reversal and slower convergence to fundamental value. The endogenous value of private information, however, is non-monotonic in risk aversion. We will mainly concentrate on the case when the private signal of the informed is static. If time permits, the implications of a dynamic signal will be discussed as well.

Based on a joint work with Albina Danilova.