17:00
Anisotropic inverse boundary value problems : the Dirichlet-to-Neumann map for the k-form Laplace equation
17:00
Canonical triangulations of quasifuchian convex cores
Abstract
Kleinian groups with an interesting deformation theory. I will show that the convex core of the quotient of hyperbolic 3-space by such a group admits a decomposition into ideal tetrahedra which is canonical in two completely independent senses: one combinatorial, the other geometric. One upshot is a proof of the Bending Lamination Conjecture for such groups.
15:45
On quasi-isometric embeddings of Lie groups into non-positively curved spaces
Abstract
I will give a characterization of connected Lie groups admitting a quasi-isometric embedding into a CAT(0) metric space. The proof relies on the study of the geometry of their asymptotic cones
15:45
From an analogue of Ewens' measure on the unitary group to the circular Jacobi ensemble
Abstract
In the first part of the talk, we fit the Hua-Pickrell measure (which is a two parameters deformation of the Haar measure) on the unitary group and the Ewens measure on the symmetric group in a same framework. We shall see that in the unitary case, the eigenvalues follow a determinantal point process with explicit hypergeometric kernels. We also study asymptotics of these kernels. The techniques used rely upon splitting of the Haar measure and sampling techniques. In the second part of the talk, we provide a matrix model for the circular Jacobi ensemble, which is the sampling used for the Hua-Pickrell measure but this time on Dyson's circular ensembles. In this case, we use the theory of orthogonal polynomials on the unit circle. In particular we prove that when the parameter of the sampling grows with n, both the spectral measure and the empirical spectral measure converge weakly in probability to a non-trivial measure supported only by one piece of the unit circle.
14:15
APOLOGIES - THIS SEMINAR IS CANCELLED Volumes of moduli spaces of algebraic curves
14:15
Local approximation and conditioning on Dawson-Watanabe superprocesses
Abstract
We consider a critical, measure-valued branching diffusion ξ in Rd, where the branching is continuous and the spatial motion is given by the heat flow. For d ≥ 2 and fixed t > 0, ξt is known to be an a.s. singular random measure of Hasudorff dimension 2. We explain how it can be approximated by Lebesgue measure on ε-neighbourhoods of the support. Next we show how ξt can be approximated in total variation near n points, and how the associated Palm distributions arise in the limit from elementary conditioning. Finally we hope to explan the duality between moment and Palm measures, and to show how the latter can be described in terms of discrete “Palm trees.”
Generating Tree Amplitudes in N=4 SYM and N=8 SG
Abstract
15:15
Schanuel’s Conjecture and free E-rings in o-minimal structures
Abstract
In recent years Schanuel’s Conjecture (SC) has played a fundamental role
in the Theory of Transcendental Numbers and in decidability issues.
Macintyre and Wilkie proved the decidability of the real exponential field,
modulo (SC), solving in this way a problem left open by A. Tarski.
Moreover, Macintyre proved that the exponential subring of R generated
by 1 is free on no generators. In this line of research we obtained that in
the exponential ring $(\mathbb{C}, ex)$, there are no further relations except $i^2 = −1$
and $e^{i\pi} = −1$ modulo SC. Assuming Schanuel’s Conjecture we proved that
the E-subring of $\mathbb{R}$ generated by $\pi$ is isomorphic to the free E-ring on $\pi$.
These results have consequences in decidability issues both on $(\mathbb{C}, ex)$ and
$(\mathbb{R}, ex)$. Moreover, we generalize the previous results obtaining, without
assuming Schanuel’s conjecture, that the E-subring generated by a real
number not definable in the real exponential field is freely generated. We
also obtain a similar result for the complex exponential field.
14:30
14:15
Some solvable portfolio optimization problems with max-martingales
Abstract
Many portfolio optimization problems are directly or indirectly concerned with the current maximum of the underlying. For example, loockback or Russian options, optimization with max-drawdown constraint , or indirectly American Put Options, optimization with floor constraints.
The Azema-Yor martingales or max-martingales, introduced in 1979 to solve the Skohorod embedding problem, appear to be remarkably efficient to provide simple solution to some of these problems, written on semi-martingale with continuous running supremum.
Fizzle or Frazzle - Problems with Ignition
Abstract
The phenomenon of ignition is one with which we are all familiar, but which is remarkably difficult to define and model effectively. My own (description rather than definition) is “initiation of a (high temperature) self-sustaining exothermic process”; it may of course be desirable, as in your car’s engine, or highly undesirable, as the cause of many disastrous fires and explosions Both laboratory experiments and numerical simulations demonstrate its extreme sensitivity to external influences, past history and process (essentially chemical) kinetics, but at the heart of all instances there appears to be some “critical” unstable equilibrium state. Though some analytical modelling has been useful in particular cases, this remains in general virgin territory for applied mathematicians – perhaps there is room for some “knowledge transfer” here.
16:00
Rational points on curves of genus one
Abstract
We recall that an elliptic curve is a curve of genus one with a rational point on it. Certain algorithms for determining the structure of the group of rational points on an elliptic curve produce a whole set of curves of genus one and then require that we determine which of these curves has a rational point.
Unfortunately no algorithm which has been proved to terminate is known for doing this. Such an algorithm or proof would probably have profound implications for the study of elliptic curves and may shed light on the Birch and Swinnerton-Dyer conjecture.
This talk will be about joint work with Samir Siksek (Warwick) on the development of a new algorithmic criterion for determining that a given curve of genus one has no rational points. Both the theory behind the criterion and recent attempts to make the criterion computationally practical, will be detailed.
Representation theory and randomization: why the permutation character of a generalized wreath product is important
A posteriori error estimates for a local-in-space timestep approach to finite element discretization of the heat equation
Moduli problems in algebraic geometry - an introduction through Hilbert and Quot schemes
Abstract
Hilbert schemes classify subschemes of a given projective variety / scheme. They are special cases of Quot schemes which are moduli spaces for quotients of a fixed coherent sheaf. Hilb and Quot are among the first examples of moduli spaces in algebraic geometry, and they are crucial for solving many other moduli problems. I will try to give you a flavour of the subject by sketching the construction of Hilb and Quot and by discussing the role they play in applications, in particular moduli spaces of stable curves and moduli spaces of stable sheaves.
17:00
15:45
14:30
Killed Branching Random Walks
Abstract
The problem is related to searching in trees. Suppose we are given a complete binary tree (a rooted tree in which the root has degree 2 and every other vertex has degree 3) with independent, identically distributed random edge weights (say copies of some random variable X, which need not be non-negative). The depth d(v) of a vertex v is the number of edges on the path from v to the root. We give each vertex v the label S_v which is the sum of the edge weights on the path from v to the root. For positive integers n, we let M_n be the maximum label of any vertex at depth n, and let M^* = max {M_n: n =0,1,...}. It is of course possible that M^* is infinity.
Under suitable moment assumptions on X, it is known that there is a constant A such that M_n/n --> A almost surely and in expectation. We call the cases A>0, A=0, and A< 0 supercritical, critical, and subcritical, respectively. When A <= 0 it makes sense to try to find the vertex of maximum weight M* in the whole tree. One possible strategy is to only explore the subtree T_0 containing the root consisting only of vertices of non-negative weight. With probability bounded away from zero this strategy finds the vertex of maximum weight. We derive precise information about the expected running time for this strategy. Equivalently, we derive precise information about the random variable |T_0|. In the process, we also derive rather precise information about M*. This answers a question of David Aldous.