SR2

A subgroup $H$ of a group $G$ is said to be engulfed if there is a
finite-index subgroup $K$ other than $G$ itself such that $H<K$, or
equivalently if $H$ is not dense in the profinite topology on $G$.  In
this talk I will present a variety of methods for showing that a
subgroup of a discrete group is engulfed, and demonstrate how these
methods can be used to study finite-sheeted covering spaces of
topological spaces.

Let F be a free group, and N a normal subgroup of F with derived subgroup N'. The Magnus embedding gives a way of seeing F/N' as a subgroup of a wreath product of a free abelian group over over F/N. The aim is to show that the Magnus embedding is a quasi-isometric embedding (hence "Q.I." in the title). For this I will use an alternative geometric definition of the embedding (hence "picture"), which I will show is equivalent to the definition which uses Fox calculus. Please note that we will assume no prior knowledge of calculus.

Saturated fusion systems are a next generation approach to the theory of finite groups- one major motivation being the opportunity to borrow techniques from homotopy theory. Extending work of Broto, Levi and Oliver, we introduce a new object - a 'tree of fusion systems' and give conditions (in terms of the orbit graph) for the completion to be saturated. We also demonstrate that these conditions are 'best possible' by producing appropriate counterexamples. Finally, we explain why these constructions provide a powerful way of building infinite families of fusion systems which are exotic (i.e. not realisable as the fusion system of a finite group) and give some concrete examples.

Results that say local information is enough to guarantee global information provide the theoretical underpinnings of many reconstruction algorithms in evolutionary biology. Such results include Buneman's Splits-Equivalence Theorem and the Tree-Metric Theorem. The first result says that, for a collection $\mathcal C$ of binary characters, pairwise compatibility is enough to guarantee compatibility for $\mathcal C$, that is, there is a phylogenetic (evolutionary) tree that realises $\mathcal C$. The second result says that, for a distance matrix $D$, if every $4\times 4$ distance submatrix of $D$ is realisable by an edge-weighted phylogenetic tree, then $D$ itself is realisable by such a tree. In this talk, we investigate these and other results of this type. Furthermore, we explore the closely-related task of determining how much information is enough to reconstruct the correct phylogenetic tree.

I will explain a construction of a group acting on a rooted tree, related to the Grigorchuk group. Those groups have exponential growth, at least under certain circumstances. I will also show how it can be seen that any two elements fulfil a non-trivial relation, implying the absence of non-cyclic free subgroups.

The study of free groups and their automorphisms has a long pedigree, going back to the work of Nielsen and Dehn in the early 20th century, but in many ways the subject only truly reached maturity with the introduction of Outer Space by Culler and Vogtmann in the “Big Bang” of 1986. In this (non-expert) talk, I will walk us through the construction of Outer Space and some related complexes, and survey some group-theoretic applications.

We use Schlage-Puchta's concept of p-deficiency and Lackenby's property of p-largeness to show that a group having a finite presentation with p-deficiency greater than 1 is large. What about when p-deficiency is exactly one? We also generalise a result of Grigorchuk on Coxeter groups to odd primes.

A construction by McCool gives rise to a finite presentation for the stabiliser of a finite set of conjugacy classes in a free group under the action of Aut(F_n) or Out(F_n). An important concept of my talk are rigid elements, which will allow to simplify these huge presentations. Finally I will sketch applications to centralisers in Aut(F_n).