L3

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).

Packings and coverings in graphs are related to two main problems of

graph theory, respectively error correcting codes and domination.

Given a set of words, an error correcting code is a subset such that

any two words in the subset are rather far apart, and can be

identified even if some errors occured during transmission. Error

correcting codes have been well studied already, and a famous example

of perfect error correcting codes are Hamming codes.

Domination is also a very old problem, initiated by some Chess problem

in the 1860's, yet Berge proposed the corresponding problem on graphs

only in the 1960's. In a graph, a subset of vertices dominates all the

graph if every vertex of the graph is neighbour of a vertex of the

subset. The domination number of a graph is the minimum number of

vertices in a dominating set. Many variants of domination have been

proposed since, leading to a very large literature.

During this talk, we will see how these two problems are related and

get into few results on these topics.