L2

The homological dimension of a group can be computed over any coefficient ring $K$.
It has long been known that if a soluble group has finite homological dimension over $K$
then it has finite Hirsch length and the Hirsch length is an upper bound for the homological
dimension. We conjecture that equality holds: i.e. the homological dimension over $K$ is
equal to the Hirsch length whenever the former is finite. At first glance this conjecture looks
innocent enough. The conjecture is known when $K$ is taken to be the integers or the field
of rational numbers. But there is a gap in the literature regarding finite field coefficients.
We'll take a look at some of the history of this problem and then show how some new near complement
and near supplement theorems for minimax groups can be used to establish the conjecture
in special cases. I will conclude by speculating what may be required to solve the conjecture outright.

In our 2004 paper, Fritz Grunewald and I constructed the first
pairs of finitely presented, residually finite groups $u: P\to G$
such that $P$ is not isomorphic to $G$ but the map that $u$ induces on
profinite completions is an isomorphism. We were unable to determine if
there might exist finitely presented, residually finite groups $G$ that
with infinitely many non-isomorphic finitely presented subgroups $u_n:
P_n\to G$ such that $u_n$ induces a profinite isomorphism. I shall
discuss how two recent advances in geometric group theory can be used in
combination with classical work on Nielsen equivalence to settle this
question.

 We present a new, more conceptual proof of our result that, when a finite group acts on a polynomial ring, the regularity of the ring of invariants is at most zero, and hence one can write down bounds on the degrees of the generators and relations. This new proof considers the action of the group on the Cech complex and looks at when it splits over the group algebra. It also applies to a more general class of rings than just polynomial ones.

Let G be a permutation group acting on a set Omega. For g in G, let pi(g) denote the partition of Omega given by the orbits of g. The set of all partitions of Omega is naturally ordered by refinement and admits lattice operations of meet and join. My talk concerns the groups G such that the partitions pi(g) for g in G form a sublattice. This condition is highly restrictive, but there are still many interesting examples. These include centralisers in the symmetric group Sym(Omega) and a class of profinite abelian groups which act on each of their orbits as a subgroup of the Prüfer group. I will also describe a classification of the primitive permutation groups of finite degree whose set of orbit partitions is closed under taking joins, but not necessarily meets.

This talk is on joint work with John R. Britnell (Imperial College).

We give a brief overview of hyperbolic metric spaces and the relatively hyperbolic counterparts, with particular emphasis on the quasi-isometry class of trees. We then show that an understanding of the relative version of such spaces - quasi tree-graded spaces -  has strong consequences for mapping class groups. In particular, they are shown to embed into a finite product of (possibly infinite valence) simplicial trees. This uses and extends the work of Bestvina, Bromberg and Fujiwara.

There is a well-acknowledged analogy between mapping class
groups and lattices in higher rank groups. I will discuss to which
extent does Margulis's superrigidity hold for mapping class groups:
examples, very partial results and questions.

I describe recent work with Pyber, Short and Szabo in which we study the `width' of a finite simple group. Given a group G and a subset A of G, the `width of G with respect to A' - w(G,A) - is the smallest number k such that G can be written as the product of k conjugates of A. If G is finite and simple, and A is a set of size at least 2, then w(G,A) is well-defined; what is more Liebeck, Nikolov and Shalev have conjectured that in this situation there exists an absolute constant c such that w(G,A)\leq c log|G|/log|A|. 
I will present a partial proof of this conjecture as well as describing some interesting, and unexpected, connections between this work and classical additive combinatorics. In particular the notion of a normal K-approximate group will be introduced.

We prove that the rank gradient vanishes for mapping class groups, Aut(Fn) for all n, Out(Fn), n > 2 and any Artin group whose underlying graph is connected. We compute the rank gradient and verify that it is equal to the first L2-Betti number for some classes of Coxeter groups.