Past

The mechanisms for the selection of the propagation speed of waves

connecting unstable to stable states will be discussed in the

spatially non-homogeneous case, the differences from the very

well-studied homogeneous version being emphasised.

Let $x$ be a CM point in the moduli space $\mathcal{A}_g(\mathbb{C})$ of principally

polarized complex abelian varieties of genus $g$, corresponding to an

Abelian variety $A$ with complex multiplication by a ring $R$. Edixhoven

conjectured that the size of the Galois orbit of x should grow at least

like a power of the discriminant ${\rm Disc}(R)$ of $R$. For $g=1$, this reduces to the

classical Brauer-Siegel theorem. A positive answer to this conjecture

would be very useful in proving the Andr\'e-Oort conjecture unconditionally.

We will present a proof of the conjectured lower bounds in some special

cases, including $g\le 6$. Along the way we derive transfer principles for

torsion in class groups of different fields which may be interesting in

their own right.

We will discuss the use of hypergraph-based methods for orderings of sparse matrices in Cholesky, LU and QR factorizations. For the Cholesky factorization case, we will investigate a recent result on pattern-wise decomposition of sparse matrices, generalize the result and develop algorithmic tools to obtain effective ordering methods. We will also see that the generalized results help us formulate the ordering problem in LU much like we do for the Cholesky case, without ever symmetrizing the given matrix $A$ as $A+A^{T}$ or $A^{T}A$. For the QR factorization case, the use of hypergraph models is fairly standard. We will nonetheless highlight the fact that the method again does not form the possibly much denser matrix $A^{T}A$. We will see comparisons of the hypergraph-based methods with the most common alternatives in all three cases.

\\

\\

This is joint work with Iain S. Duff.

Cubature on Wiener space" is a numerical method for the weak

approximation of SDEs. After an introduction to this method we present

some cases when the method is computationally expensive, and highlight

some techniques that improve the tractability. In particular, we adapt

the Multilevel Monte-Carlo framework and extend the Milstein-scheme

based version of Mike Giles to higher dimensional and higher degree cases.

We will give an introduction to the theory of d-manifolds, a new class of geometric objects recently/currently invented by Joyce (see http://people.maths.ox.ac.uk/joyce/dmanifolds.html). We will start from scratch, by recalling the definition of a 2-category and talking a bit about $C^\infty$-rings, $C^\infty$-schemes and d-spaces before giving the definition of what a d-manifold should be. We will then discuss some properties of d-manifolds, and say some words about d-manifold bordism and its applications.

We will start off with a crash course in General relativity, and then I'll describe a 'recipe' for a time machine. This will lead us to the question whether or not the topology of the universe can change. We will see that, in some sense, this is topologically allowed. However, the Einstein equation gives a certain condition on the Ricci tensor (which is violated by certain quantum effects) and meeting this condition is a more delicate problem.

In biological cells, molecules are transported actively or by diffusion and react with each other when they are close.

The reactions occur with certain probability and there are few molecules of some chemical species. Therefore, a stochastic model is more accurate compared to a deterministic, macroscopic model for the concentrations based on partial differential equations.

At the mesoscopic level, the domain is partitioned into voxels or compartments. The molecules may react with other molecules in the same voxel and move between voxels by diffusion or active transport. At a finer, microscopic level, each individual molecule is tracked, it moves by Brownian motion and reacts with other molecules according to the Smoluchowski equation. The accuracy and efficiency of the simulations are improved by coupling the two levels and only using the micro model when it is necessary for the accuracy or when a meso description is unknown.

Algorithms for simulations with the mesoscopic, microscopic and meso-micro models will be described and applied to systems in molecular biology in three space dimensions.

Cell motility is a crucial part of many biological processes including wound healing, immunity and embryonic development. The interplay between mechanical forces and biochemical control mechanisms make understanding cell motility a rich and exciting challenge for mathematical modelling. We consider the two-phase, poroviscous, reactive flow framework used in the literature to describe crawling cells and present a stripped down version. Linear stability analysis and numerical simulations provide insight into the onset of polarization of a stationary cell and reveal qualitatively distinct families of travelling wave solutions. The numerical solutions also capture the experimentally observed behaviour that cells crawl fastest when the surface they crawl over is neither too sticky nor too slippy.

We introduce the notion of a real cubing. Roughly speaking, real cubings are to CAT(0) cube complexes what real trees are to simplicial trees. We develop an analogue of the Rips’ machine and establish the structure of groups acting nicely on real cubings.

To identify the Martin boundary for a transient Markov chain with Green's function G(x,y), one has to identify all possible limits Lim G(x,y_n)/G(0,y_n) with y_n "tending to infinity". For homogeneous random walks, these limits are usually obtained from the exact asymptotics of Green's function G(x,y_n). For non-homogeneous random walks, the exact asymptotics af Green's function is an extremely difficult problem. We discuss several examples where Martin boundary can beidentified by using large deviation technique. The minimal Martin boundary is in general not homeomorphic to the "radial"  compactification obtained by Ney and Spitzer for homogeneous random walks in Z^d : convergence of a sequence of points y_n toa point on the Martin boundary does not imply convergence of the sequence y_n/|y_n| on the unit sphere. Such a phenomenon is a consequence of non-linear optimal large deviation trajectories.

Symplectic implosion is a construction in symplectic geometry due to Guillemin, Jeffrey and Sjamaar, which is related to geometric invariant theory for non-reductive group actions in algebraic geometry. This talk (based on joint work in progress with Andrew Dancer and Andrew Swann) is concerned with an analogous construction in hyperkahler geometry.

 In the recent series of papers Kleban, Simmons, and Ziff gave a non-rigorous computation  (base on Conformal Field Theory) of probabilities of several connectivity events for critical percolation. In particular they showed that the probability that there is a percolation cluster connecting two points on the boundary and a point inside the domain can be factorized in therms of pairwise connection probabilities. We are going to use SLE techniques to rigorously compute probabilities of several connectivity events and prove the factorization formula.

We compute three-point functions of single trace operators in planar N = 4 SYM. We consider the limit where one of the operators is much smaller than the other two. We find a precise match between weak and strong coupling in the Frolov-Tseytlin classical limit for a very general class of classical solutions. To achieve this match we clarify the issue of back-reaction and identify precisely which three-point functions are captured by a classical computation.

The standard approach to continuous-time finance starts from postulating a

statistical model for the prices of securities (such as the Black-Scholes

model). Since such models are often difficult to justify, it is

interesting to explore what can be done without any stochastic

assumptions. There are quite a few results of this kind (starting from

Cover 1991 and Hobson 1998), but in this talk I will discuss

probability-type properties emerging without a statistical model. I will

only consider the simplest case of one security, and instead of stochastic

assumptions will make some analytic assumptions. If the price path is

known to be cadlag without huge jumps, its quadratic variation exists

unless a predefined trading strategy earns infinite capital without

risking more than one monetary unit. This makes it possible to apply the

known results of Ito calculus without probability (Follmer 1981, Norvaisa)

in the context of idealized financial markets. If, moreover, the price

path is known to be continuous, it becomes Brownian motion when physical

time is replaced by quadratic variation; this is a probability-free

version of the Dubins-Schwarz theorem.

(Joint with Ronnie Nagloo.) I investigate algebraic relations between sets of solutions (and their derivatives) of the "generic" Painlev\'e equations I-VI, proving a somewhat weaker version of ``there are NO algebraic relations".