L3

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.

In recent joint work with Maarten Solleveld we could give a complete classification of the set the irreducible discrete series characters of affine Hecke algebras (including the non simply-laced cases). The results can be formulated in terms of the K-theory of the Schwartz completion of the Hecke algebra. We discuss these results and some related conjectures on formal dimensions and on elliptic characters.

I plan to discuss some aspects the mysterious relationship between the symmetries of toroidal compactifications of M-theory and helices on del Pezzo surfaces.

We outline a method to solve the stationary Einstein equations with source a body in rigid rotation consisting of elastic matter.

This is work in progress by R.B., B.G.Schmidt, and L.Andersson

Abstract: The Maximum Induced Planar Subgraph problem asks

for the largest set of vertices in a given input graph G

that induces a planar subgraph of G. Equivalently, we may

ask for the smallest set of vertices in G whose removal

leaves behind a planar subgraph. This problem has been

linked by Edwards and Farr to the problem of _fragmentability_

of graphs, where we seek the smallest proportion of vertices

in a graph whose removal breaks the graph into small (bounded

size) pieces. This talk describes some algorithms

developed for this problem, together with theoretical and

experimental results on their performance. The material

presented is joint work either with Keith Edwards (Dundee)

or Kerri Morgan (Monash).