Oxford

I will present a new proof of Mumford's conjecture on the rational cohomology of moduli spaces of curves, which is substantially different from those given by Madsen--Weiss and Galatius--Madsen--Tillmann--Weiss: in particular, it makes no use of Harer--Ivanov stability for the homology of mapping class groups, which played a decisive role in the previously known proofs. This talk represents joint work with Soren Galatius.

Triply graded link homology (introduced by Khovanov and Rozansky) is a

categorification of the HOMFLYPT polynomial. In this talk I will discuss

recent joint work with Ben Webster which gives a geometric construction of this invariant in terms of equivariant constructible sheaves. In this

framework the Reidemeister moves have quite natural geometric proofs. A

generalisation of this construction yields a categorification of the

coloured HOMFLYPT polynomial, constructed (conjecturally) by Mackay, Stosic and Vaz. I will also describe how this approach leads to a natural formula for the Jones-Ocneanu trace in terms of the intersection cohomology of Schubert varieties in the special linear group.

This talk will be based on a joint work with Professor Terry Lyons and Mr Gechun Liang (OMI). I will explain a new approach to define and to solve a class of backward dynamic systems including the well known examples of non-linear backward SDE. The new approach does not require any kind of martingale representation or any specific restriction on the probability base in question, and therefore can be applied to a much wider class of backward systems.

We consider the analysis for a class of random differential equations driven by rough noise and with a trajectory that is influenced by its own law. Having described the mathematical setup with great precision, we will illustrate how such equations arise naturally as the limits of a cloud of interacting particles. Finally, we will provide examples to show the ubiquity of such systems across a range of physical and economic phenomena and hint at possible extensions.

In a quantum network model, unitary matrices are assigned to each edge and node of a graph.  The quantum amplitude for a particle to propagate from node A to node B is the sum over all random walks (Feynman paths) from A to B, each walk being weighted by the ordered product of matrices along the path.  In most cases these models are too difficult to solve analytically, but I shall argue that when the matrices are random elements of SU("), independently drawn from the invariant measure on that group, then averages of these quantum amplitudes are equal to the probability that a certain kind of self-avoiding *classical* random walk reaches B when started at A.  This leads to various conjectures about the generic behaviour of such network models on regular lattices in two and three dimensions.