Past

We say a group is accessible if the process of iteratively decomposing G as an amalgamated free product or HNN extension over a finite group terminates in a finite number of steps. We will see Dunwoody's proof that FP2 groups are accessible, but that finitely generated groups need not be. If time permits, we will examine generalizations by Bestvina-Feighn, Sela and Louder.

CANCELLED - CANCELLED - CANCELLED

The notion of prime decomposition will be defined and illustrated for
manifolds. Two proofs of existence will be given, including Kneser's
classical proof using normal surface theory.

Let G be a transitive permutation group. If G is finite, then a classical theorem of Jordan implies the existence of fixed-point-free elements, which we call derangements. This result has some interesting and unexpected applications, and it leads to several natural problems on the abundance and order of derangements that have been the focus of recent research. In this talk, I will discuss some of these related problems, and I will report on recent joint work with Hung Tong-Viet on primitive permutation groups with extremal derangement properties.

I present a new method for optimizing quadratic functions subject to simple bound constraints.  If the problem happens to be strictly convex, the algorithm reduces to a highly efficient method by Dostal and Schoberl.  Our algorithm, however, is also able to efficiently solve nonconcex problems. During this talk I will present the algorithm, a sketch of the convergence theory, and numerical results for convex and nonconvex problems.

I will present a joint work with Leonid Kovalev and Jani Onninen. The proofs are  based on topological arguments (degree theory)  and the properties  of planar  quasiconformal mappings. These new ideas  apply well to inner variational equations of conformally invariant energy integrals; in particular, to the Hopf-Laplace equation for the Dirichlet integral.

We work in the context of Markovian rough paths associated to a class of uniformly subelliptic Dirichlet forms and prove an almost-Gaussian tail-estimate for the accumulated local p-variation functional, which has been introduced and studied by Cass, Litterer and Lyons. We comment on the significance of these estimates to a range of currently-studied problems, including the recent results of Ni Hao, and Chevyrev and Lyons.

The triangulation conjecture stated that any n-dimensional topological manifold is homeomorphic to a simplicial complex. It is true in dimensions at most 3, but false in dimension 4 by the work of Casson and Freedman. In this talk I will explain the proof that the conjecture is also false in higher dimensions. This result is based on previous work of Galewski-Stern and Matumoto, who reduced the problem to a question in low dimensions (the existence of elements of order 2 and Rokhlin invariant one in the 3-dimensional homology cobordism group). The low-dimensional question can be answered in the negative using a variant of Floer homology, Pin(2)-equivariant Seiberg-Witten Floer homology. At the end I will also discuss a related version of Heegaard Floer homology, which is more computable.

The main goal of the talk is to set up a framework for constructing the likelihood for discretely observed RDEs. The main idea is to contract a function mapping the discretely observed data to the corresponding increments of the driving noise. Once this is known, the likelihood of the observations can be written as the likelihood of the increments of the corresponding noise times the Jacobian correction.

Constructing a function mapping data to noise is equivalent to solving the inverse problem of looking for the input given the output of the Ito map corresponding to the RDE. First, I simplify the problem by assuming that the driving noise is linear between observations. Then, I will introduce an iterative process and show that it converges in p-variation to the piecewise linear path X corresponding to the observations. Finally, I will show that the total error in the likelihood construction is bounded in p-variation.

A long-standing problem in almost complex geometry has been the question of existence of (complete) inhomogeneous nearly Kahler 6-manifolds. One of the main motivations for this question comes from $G_2$ geometry: the Riemannian cone over a nearly Kahler 6-manifold is a singular space with holonomy $G_2$.

Viewing Euclidean 7-space as the cone over the round 6-sphere, the induced nearly Kahler structure is the standard $G_2$-invariant almost complex structure on the 6-sphere induced by octonionic multiplication. We resolve this problem by proving the existence of exotic (inhomogeneous) nearly Kahler metrics on the 6-sphere and also on the product of two 3-spheres. This is joint work with Lorenzo Foscolo, Stony Brook.

This talk will describe methods for computing sharp upper bounds on the probability of a random vector falling outside of a convex set, or on the expected value of a convex loss function, for situations in which limited information is available about the probability distribution. Such bounds are of interest across many application areas in control theory, mathematical finance, machine learning and signal processing. If only the first two moments of the distribution are available, then Chebyshev-like worst-case bounds can be computed via solution of a single semidefinite program. However, the results can be very conservative since they are typically achieved by a discrete worst-case distribution. The talk will show that considerable improvement is possible if the probability distribution can be assumed unimodal, in which case less pessimistic Gauss-like bounds can be computed instead. Additionally, both the Chebyshev- and Gauss-like bounds for such problems can be derived as special cases of a bound based on a generalised definition of unmodality.

In joint work with Todor Tsankov, we show that the automorphism groups of countable, omega-categorical structures have Kazhdan's property (T). The proof uses Tsankov's work on the unitary representations of these groups, together with a construction of a particular free subgroup of the automorphism group.

The Ising model is a well-known statistical physics model, defined on a two-dimensional lattice. It is interesting because it exhibits a "phase transition" at a certain critical temperature. Recent mathematical research has revealed an intriguing geometry in the model, involving discrete holomorphic functions, spinors, spin structures, and the Dirac equation. I will try to outline some of these ideas.

We derive a closed form portfolio optimization rule for an investor who is diffident about mean return and volatility estimates, and has a CRRA utility. The novelty is that confidence is here represented using ellipsoidal uncertainty sets for the drift, given a volatility realization. This specification affords a simple and concise analysis, as the optimal portfolio allocation policy is shaped by a rescaled market Sharpe ratio, computed under the worst case volatility. The result is based on a max-min Hamilton-Jacobi-Bellman-Isaacs PDE, which extends the classical Merton problem and reverts to it for an ambiguity-neutral investor.

The Cohen-Lenstra heuristics, postulated in the early 80s, conceptually explained numerous phenomena in the behaviour of ideal class groups of number fields that had puzzled mathematicians for decades, by proposing a probabilistic model: the probability that the class group of an imaginary quadratic field is isomorphic to a given group $A$ is inverse proportional to $\#\text{Aut}(A)$. This is a very natural model for random algebraic objects. But the probability weights for more general number fields, while agreeing well with experiments, look rather mysterious. I will explain how to recover the original heuristic in a very conceptual way by phrasing it in terms of Arakelov class groups instead. The main difficulty that one needs to overcome is that Arakelov class groups typically have infinitely many automorphisms. We build up a theory of commensurability of modules, of groups, and of rings, in order to remove this obstacle. This is joint work with Hendrik Lenstra.

This talk covers two topics: (1) Phenotype change, where we consider the steady-fitness states, in a model developed by Korobeinikov and Dempsey (2014), in which the phenotype is modelled on a continuous scale providing a structured variable to quantify the phenotype state. This enables thresholds for survival/extinction to be established in terms of fitness.

Topic (2) looks at the steady-size distribution of an evolving cohort of cells, such as tumour cells in vitro, and therein establishes thresholds for growth or decay of the cohort. This is established using a new class of non-local (but linear) singular eigenvalue problems which have point spectra, like the traditional Sturm-Liouville problems.  The first eigenvalue gives the threshold required. But these problems are first order unless dispersion is added to incorporate random perturbations. But the same idea will apply here also.  Current work involves binary asymmetrical division of cells, simultaneous with growth. It has implications to cancer biology, helping biologists to conceptualise non-local effects and the part they may play in cancer. This is developed in Zaidi et al (2015).

Acknowledgement. The support of Gravida (NCGD) is gratefully acknowledged.

References

Korobeinikov A & Dempsey C. A continuous phenotype space model of RNA virus evolution within a host. Mathematical Biosciences and Engineering 11, (2014), 919-927.

Zaidi AA, van-Brunt B, & Wake GC. A model for asymmetrical cell division Mathematical Biosciences and Engineering (June 2015).

Although Toeplitz matrices are often dense, matrix-vector products with Toeplitz matrices can be quickly performed via circulant embedding and the fast Fourier transform. This makes their solution by preconditioned Krylov subspace methods attractive. 

For a wide class of symmetric Toeplitz matrices, symmetric positive definite circulant preconditioners that cluster eigenvalues have been proposed. MINRES or the conjugate gradient method can be applied to these problems and descriptive convergence theory based on eigenvalues guarantees fast convergence. 

In contrast, although circulant preconditioners have been proposed for nonsymmetric Toeplitz systems, guarantees of fast convergence are generally only available for CG for the normal equations (CGNE). This is somewhat unsatisfactory because CGNE has certain drawbacks, including slow convergence and a larger condition number. In this talk we discuss a simple alternative symmetrization of nonsymmetric Toeplitz matrices, that allows us to use MINRES to solve the resulting linear system. We show how existing circulant preconditioners for nonsymmetric Toeplitz matrices can be straightforwardly adapted to this situation and give convergence estimates similar to those in the symmetric case.