Charlie Sims, Rutgers University

Abstract:
Three important tools for computing with a finitely presented group are coset enumeration, the Knuth-Bendix procedure for strings, and the Reidemeister-Schreier procedure. Recent investigations of several groups have led to new insights into ways these tools can be used. These insights will be illustrated with B(2,6), the two-generator Burnside group of exponent 6, and E(2,4), the freest two-generator 4-Engel group.