Past

"Rough paths of inhomogeneous degree of smoothness (Pi-rough paths) can be treated as p-rough paths (of homogeneous degree of
smoothness) for a sufficiently large p. The theory of integration with respect to p-rough paths can be applied to prove existence and uniqueness of solutions of differential equations driven by Pi-rough paths. However the required conditions on the one-form determining the differential equation are too strong and can be weakened. The talk proves the existence and uniqueness under weaker conditions and explores some applications of Pi-rough paths

The behaviour of the tail of the distribution of the first passage time over a fixed level has been known for many years, but until recently little was known about the behaviour of the probability mass function or density function. In this talk we describe recent results of Vatutin and Wachtel, Doney, and Doney and Rivero which give such information whenever the random walk or Levy process is asymptotically stable.

Many proteins cleave and reseal DNA molecules in precisely orchestrated
ways. Modelling these reactions has often relied on the axis of the DNA
double helix
being circular, so these cut-and-seal mechanisms can be
tracked by corresponding changes in the knot type of the DNA axis.
However, when the DNA molecule is linear, or the
protein action does not manifest itself as a change in knot type, or the
knots types are not 4-plats, these knot theoretic models are less germane.

We thus give a taxonomy of local DNA axis configurations. More precisely, we
characterise
all rational tangles obtained from a given rational tangle via a rational
subtangle
replacement (RSR). This builds on work of Berge and Gabai. 
We further determine the sites for these RSR of distance greater than 1.
Finally, we classify all knots in lens spaces whose exteriors are
generalised Seifert fibered spaces and their lens space surgeries, extending work of
Darcy-Sumners.

Biologically then, this classification is endowed with a distance that
determines how many protein reactions
of a particular type (corresponding to steps of a specified size) are
needed to proceed from one local conformation to another.
We conclude by discussing a variety of biological applications of this
categorisation.

Joint work with Ken Baker

The central axis of the famous DNA double helix can become knotted
or linked as a result of numerous biochemical processes, most notably
site-specific recombination. Site-specific recombinases are naturally
occurring enzymes that cleave and reseal DNA molecules in very precise ways.
As a by product of their main purpose, they manipulate cellular DNA in
topologically interesting and non-trivial ways. So if the axis of the DNA
double helix is circular, these cut-and-seal mechanisms can be tracked by
corresponding changes in the knot type of the DNA axis.  In this talk, I'll
explain several topological strategies to investigate these biological
situations. As a concrete example, I will disscuss my recent work, which
predics what types of DNA knots and links can arise from site-specific
recombination on DNA twist knots.

Persistent homology is a relatively new tool to analyse the topology of data sets.

We will give a brief introduction and tutorial as preparation for the third talk in the afternoon.

We present three examples of credit products whose valuation poses challenging modeling problems related to armageddon scenarios and extreme losses, analyzing their behaviour pre- and in-crisis.

The products are Credit Index Options (CIOs), Collateralized Debt Obligations (CDOs), and Credit Valuation Adjustment (CVA) related products. We show that poor mathematical treatment of possibly vanishing numeraires in CIOs and lack of modes in the tail of the loss distribution in CDOs may lead to inaccurate valuation, both pre- and especially in crisis. We also consider the limits of copula models in trying to represent systemic risk in credit intensity models. We finally enlarge the picture and comment on a number of common biases in the public perception of modeling in relationship with the crisis.

This will be on the topic of the CASE project Thales will be sponsoring from Oct '11.

It is known that the expansion of the real field by some quasianalytic algebras of functions are o-minimal and polynomially bounded. We prove that, for these structures, the preparation theorem for definable functions proved by L. van den Dries and P. Speissegger has an explicit form, from which it is easy to deduce a quantifier elimination result.

"Most drivers will recognize the scenario: you are making steady progress along the motorway when suddenly you come to a sudden halt at the tail end of a lengthy queue of traffic. When you move off again you look for the cause of the jam, but there isn't one. No accident damaged cars, no breakdown, no dead animal, and no debris strewn on the road. So what caused everyone to stop?" RAC news release (2005)

The (by now well-known) answer is that such "phantom traffic jams" exist as waves that propagate upstream (opposite to the driving direction) - so that the vast majority of individuals do not observe the instant at which the jam was created - yet what exactly goes on at that instant is still a matter of debate. In this talk I'll give an overview of empirical data and models to describe such spatiotemporal patterns. The key property we need is instability: and using the framework of car-following (CF) models, I'll show how different sorts of linear (convective and absolute) and nonlinear instability can be used to explain empirical patterns.

Polynomial Programs are ussually solved by using hierarchies of convex relaxations. This scheme rapidly becomes computationally expensive and is often tractable only for problems of small sizes. We propose an iterative scheme that improves an initial relaxation without incurring exponential growth in size. The key ingredient is a dynamic scheme for generating valid polynomial inequalities for general polynomial programs. These valid inequalities are then used to construct better approximations of the original problem. As a result, the proposed scheme is in principle scalable to large general combinatorial optimization problems.

Joint work with Bissan Ghaddar and Miguel Anjos

The topology of the moduli space of stable bundles (of coprime rank and degree) on a smooth curve can be understood from different points of view. Atiyah and Bott calculated the Betti numbers by gauge-theoretic methods (using equivariant Morse theory for the Yang-Mills functional), arriving at the same inductive formula which had been obtained previously by Harder and Narasimhan using arithmetic techniques. An intermediate interpretation (algebro-geometric in nature but dealing with infinite-dimensional parameter spaces as in the gauge theory picture) comes from thinking about vector bundles in terms of matrix divisors, generalising the Abel-Jacobi map to higher rank bundles.

I'll sketch these different approaches, emphasising their parallels, and in the end I'll speculate about how (some of) these methods could be made to work when the underlying curve acquires nodal singularities.

We consider an optimal stopping problem arising in connection with the exercise of an executive stock option by an agent with inside information.

The agent is assumed to have noisy information on the terminal value of the stock, does not trade the stock or outside securities, and maximises the expected discounted payoff over all stopping times with regard to an enlarged filtration which includes the inside information. This leads to a stopping problem governed by a time-inhomogeneous diffusion and a call-type reward. Using stochastic flow ideas we establish properties of the value function (monotonicity, convexity in the log-stock price), conditions under which the option value exhibits time decay, and derive the smooth fit condition for the solution to the free boundary problem governing the maximum expected reward. From this we derive the early exercise decomposition of the value function. The resulting integral equation for the unknown exercise boundary is solved numerically and this shows that the insider may exercise the option before maturity, in situations when an agent without the privileged information may not.

We propose a general framework for the study of $L^1$ contractive semigroups of solutions to conservation laws with discontinuous flux. Developing the ideas of a number of preceding works we claim that the whole admissibility issue is reduced to the selection of a family of "elementary solutions", which are certain piecewise constant stationary weak solutions. We refer to such a family as a "germ". It is well known that (CL) admits many different $L^1$ contractive semigroups, some of which reflects different physical applications. We revisit a number of the existing admissibility (or entropy) conditions and identify the germs that underly these conditions. We devote specific attention to the anishing viscosity" germ, which is a way to express the "$\Gamma$-condition" of Diehl. For any given germ, we formulate "germ-based" admissibility conditions in the form of a trace condition on the flux discontinuity line $x=0$ (in the spirit of Vol'pert) and in the form of a family of global entropy inequalities (following Kruzhkov and Carrillo). We characterize those germs that lead to the $L^1$-contraction property for the associated admissible solutions. Our approach offers a streamlined and unifying perspective on many of the known entropy conditions, making it possible to recover earlier uniqueness results under weaker conditions than before, and to provide new results for other less studied problems. Several strategies for proving the existence of admissible solutions are discussed, and existence results are given for fluxes satisfying some additional conditions. These are based on convergence results either for the vanishing viscosity method (with standard viscosity or with specific viscosities "adapted" to the choice of a germ), or for specific germ-adapted finite volume schemes.

This is joint work with Boris Andreianov and Nils Henrik Risebro.

I will give a brief introduction to the Steenrod squares and move on to show some applications of them in Topology and Geometry.

The representation theory of the symmetric groups is far more advanced than that of arbitrary finite groups. The blocks of symmetric groups with defect group of order pⁿ are classified, in the sense that there is a finite list of possible Morita equivalence types of blocks, and it is relatively straightforward to write down a representative from each class.

In this talk we will look at the case where n=2. Here the theory is fairly well understood. After introducing combinatorial wizardry such as cores, the abacus, and Scopes moves, we will see a new result, namely that the simple modules for any p-block of weight 2 "come from" (technically, have isomorphic sources to) simple modules for S_2p or the wreath product of S_p and C₂.

I will prove that generating sets of surface groups are either reducible or Nielsen equivalent to standard generating sets, improving upon a theorem of Zieschang. Equivalently, Aut(F_n) acts transitively on Epi(F_n,S) when S is a surface group.

I will explain how essential information about the structure of symplectic manifolds is captured by algebraic data, and specifically by the non-commutative mixed Hodge structure on the cohomology of the Fukaya category. I will discuss computable Hodge theoretic invariants arising from twist functors, and from geometric extensions. I will also explain how the instanton-corrected Chern-Simons theory fits in the framework of normal functions in non-commutative Hodge theory and will give applications to explicit descriptions of quantum Lagrangian branes. This is a joint work with L. Katzarkov and M. Kontsevich.

The classical isoperimetric inequality states that, given a set $E$ in $R^n$ having the same measure of the unit ball $B$, the perimeter $P(E)$ of $E$ is greater than the perimeter $P(B)$ of $B$. Moreover, when the isoperimetric deficit $D(E)=P(E)-P(B)$ equals 0, than $E$ coincides (up to a translation) with $B$. The sharp quantitative form of the isoperimetric inequality states that $D(E)$ can be bound from below by $A(E)^2$, where the Fraenkel asymmetry $A(E)$ of $E$ is defined as the minimum of the volume of the symmetric difference between $E$ and any translation of $B$. This result, conjectured by Hall in 1990, has been proven in its full generality by Fusco-Maggi-Pratelli (Ann. of Math. 2008) via symmetrization arguments and more recently by Figalli-Maggi-Pratelli (Invent. Math. 2010) through optimal transportation techniques. In this talk I will present a new proof of the sharp quantitative version of the isoperimetric inequality that I have recently obtained in collaboration with G.P.Leonardi (University of Modena e Reggio). The proof relies on a variational method in which a penalization technique is combined with the regularity theory for quasiminimizers of the perimeter. As a further application of this method I will present a positive answer to another conjecture posed by Hall in 1992 concerning the best constant for the quantitative isoperimetric inequality in $R^2$ in the small asymmetry regime.

The curve complex on an orientable surface, introduced by William Harvey about 30 years ago, is the abstract simplicial complex whose vertices are isotopy classes of simple close curves. A set of vertices forms a simplex if they can be represented by pairwise disjoint elements. The mapping class group of S acts on this complex in a natural way, inducing a homomorphism from the mapping class group to the group of automorphisms of the curve complex. A remarkable theorem of Nikolai V. Ivanov says that this natural homomorphism is an isomorphism. From this fact, some algebraic properties of the mapping class group has been proved. In the last twenty years, this result has been extended in various directions. In the joint work with Ferihe Atalan, we have proved the corresponding theorem for non-orientable surfaces: the natural map from the mapping class group of a nonorientable surface to the automorphism group of the curve compex is an isomorphism. I will discuss the proof of this theorem and possible applications to the structure of the mapping class groups.

Let $X$ be a Poisson point process and $K$ a d-dimensional convex set.
For a point $x \in X$ denote by $v_X(x)$ the Voronoi cell with respect to $X$, and set $$ v_X (K) := \bigcup_{x \in X \cap K } v_X(x) $$ which is the union of all Voronoi cells with center in $K$. We call $v_X(K)$ the Poisson-Voronoi approximation of $K$.
For $K$ a compact convex set the volume difference $V_d(v_X(K))-V_d(K) $ and the symmetric difference $V_d(v_X(K) \triangle K)$ are investigated.
Estimates for the variance and limit theorems are obtained using the chaotic decomposition of these functions in multiple Wiener-Ito integrals

The Harder Narasimhan type (in the sense of Gieseker semistability)

of a pure-dimensional coherent sheaf on a projective scheme is known to vary

semi-continuously in a flat family, which gives the well-known Harder Narasimhan

stratification of the parameter scheme of the family, by locally closed subsets.

We show that each stratum can be endowed with a natural structure of a locally

closed subscheme of the parameter scheme, which enjoys an appropriate universal property.

As an application, we deduce that pure-dimensional coherent sheaves of any given

Harder Narasimhan type form an Artin algebraic stack.

As another application - jointly with L. Brambila-Paz and O. Mata - we describe

moduli schemes for certain rank 2 unstable vector bundles on a smooth projective

curve, fixing some numerical data.

Non-linear backward stochastic differential equations (BSDEs in

short) were firstly introduced by Pardoux and Peng (\cite{PP1990},

1990), who proved the existence and uniqueness of the adapted solution, under smooth square integrability assumptions on the coefficient and the terminal condition, and when the coefficient $g(t,\omega ,y,z)$ is Lipschitz in $(y,z)$ uniformly in $(t,\omega

)$. From then on, the theory of backward stochastic differential equations (BSDE) has been widely and rapidly developed. And many problems in mathematical finance can be treated as BSDEs. The natural connection between BSDE and partial differential equations (PDE) of parabolic and elliptic types is also important applications. In this talk, we study a new developement of BSDE, 

BSDE with contraint and reflecting barrier.

The existence and uniqueness results are presented and we will give some application of this kind of BSDE at last.

We will sketch a new proof of the Theorem of Ax and Kochen that any projective hypersurface over the p-adic numbers has a p-adic rational point, if it is given by a homogeneous polynomial with more variables than the square of its degree d, assuming that p is large enough with respect to the degree d. Our proof is purely algebraic geometric and (unlike all previous ones) does not use methods from mathematical logic. It is based on a (small upgrade of a) theorem of Abramovich and Karu about weak toroidalization of morphisms. Our method also yields a new alternative approach to the model theory of henselian valued fields (including the Ax-Kochen-Ersov transfer principle and quantifier elimination).

Rubbers and biological soft tissues undergo large isochoric motions in service, and can thus be modelled as nonlinear, incompressible elastic solids. It is easy to enforce incompressibility in the finite (exact) theory of nonlinear elasticity, but not so simple in the weakly nonlinear formulation, where the stress is expanded in successive powers of the strain. In linear and second-order elasticity, incompressibility means that Poisson's ratio is 1/2. Here we show how third- and fourth-order elastic constants behave in the incompressible limit. For applications, we turn to the propagation of elastic waves in soft incompressible solids, a topic of crucial importance in medical imaging (joint work with Ray Ogden, University of Aberdeen).

I will talk about a recent paper of Huh, who, building on a wealth of pretty geometry and topology, has given a proof of a conjecture dating back to 1968 regarding the chromatic polynomial (the polynomial that determines how many ways there are of colouring the vertices of a graph with n colours in such a way that no vertices which are joined by an edge have the same colour). I will mainly talk about the way in which a problem that is explicitly a combinatorics problem came to be encoded in algebraic geometry, and give an overview of the geometry and topology that goes into the solution. The talk should be accessible to everyone: no stacks, I promise.

The reconstruction of the early universe amounts to recovering the tiny density fluctuations of the early universe (shortly after the "big bang") from the current observation of the matter distribution in the universe. Following Zeldovich, Peebles and, more recently Frisch and collaboratoirs, we use a newtonian gravitational model with time dependent coefficients taking into accont general relativity effects. Due to the (remarkable) convexity of the corresponding action, the reconstruction problem apparently reduces to a straightforward convex minimization problem. Unfortunately, this approach completely ignores the mass concentration effects due to gravitational instabilities.

In this lecture, we show a way of modifying the action in order to take concentrations into account. This is obtained through a (questionable) modification of the gravitation model,

by substituting the fully nonlinear Monge-Amp`ere equation for the linear Poisson equation. (This is a reasonable approximation in the sense that it makes exact some approximate solutions advocated by Zeldovich for the original gravitational model.) Then the action can be written as a perfect square in which we can input mass concentration effects in a canonical way, based on the theory of gradient flows with convex potentials and somewhat related to the concept of self-dual Lagrangians developped by Ghoussoub. A fully discrete algorithm is introduced for the EUR problem in one space dimension.

The construction of the asymptotic cone of a metric space which allows one to capture the "large scale geometry" of that space has been introduced by Gromov and refined by van den Dries and Wilkie in the 1980's. Since then asymptotic cones have mainly been used as important invariants for finitely generated groups, regarded as metric spaces using the word metric.

However since the construction of the cone requires non-principal ultrafilters, in many cases the cone itself is very hard to compute and seemingly basic questions about this construction have been open quite some time and only relatively recently been answered.

In this talk I want to review the definition of the cone as well as considering iterated cones of metric spaces. I will show that every proper metric space can arise as asymptotic cone of some other proper space and I will answer a question of Drutu and Sapir regarding slow ultrafilters.

I will give a short introduction to non-standard analysis using Nelson's Internal Set Theory, and attempt to give some interesting examples of what can be done in NSA. If time permits I will look at building models for IST inside the usual ZFC set theory using ultrapowers.