We study the maximal subgroups of free idempotent generated semigroups on a biordered set by topological methods. These subgroups are realized as the fundamental groups of a number of 2-complexes naturally associated to the biorder structure of the set of idempotents. We use this to construct the first example of a free idempotent generated semigroup containing a non-free subgroup.

We will classify all exceptional Dehn surgeries on 2-bridge knots according to whether they produce reducible, toroidal, or Seifert fibered manifolds.

No abstract

No abstract

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. A comparison with automatic groups is given. Another characterization of autostackability is given in terms of prefix-rewriting systems. Every group which admits a finite complete rewriting system or an asynchronously automatic structure with respect to a prefix-closed set of normal forms is also autostackable. As a consequence, the fundamental group of every closed 3-manifold with any of the eight possible uniform geometries is autostackable.