Durham University

In this talk we will start by introducing the notion of Siegel-Jacobi modular form and explain its close relation to Siegel modular forms through the Fourier-Jacobi expansion. Then we will discuss how one can attach an L-function to an appropriate (i.e. eigenform) Siegel-Jacobi modular form due to Shintani, and report on joint work with Jolanta Marzec on analytic properties of this L-function, extending results of Arakawa and Murase. 

While it is believed that many particle systems have periodic ground states, there are few rigorous crystallization results in two and more dimensions. In this talk I will show how results by the Hungarian geometer László Fejes Tóth can be used to prove that an idealised block copolymer energy is minimised by the triangular lattice. I will also discuss a numerical method for a broader class of optimal location problems and some conjectures about minimisers in three dimensions. This is joint work with Mark Peletier, Steven Roper and Florian Theil. 

A number of phylogenetic algorithms proceed by searching the space of all possible phylogenetic (leaf labeled) trees on a given set of taxa, using topological rearrangements and some optimality criterion. Recently, such an approach, called BSPR, has been applied to the balanced minimum evolution principle. Several computer studies have demonstrated the accuracy of BSPR in reconstructing the correct tree. It has been conjectured that BSPR is consistent, that is, when applied to an input distance that is a tree-metric, it will always converge to the (unique) tree corresponding to that metric. Here we prove that this is the case. Moreover, we show that even if the input distance matrix contains small errors relative to the tree-metric, then the BSPR algorithm will still return the corresponding tree.