The B.B. Newman Spelling Theorem
by
Chris Hruska
Cornell University
Coauthors: Dani Wise

The Spelling Theorem of B.B. Newman states that a one-relator group with torsion has a Dehn's algorithm for reducing trivial words to the identity. In particular, this implies that these groups are all word-hyperbolic.

I will present a new proof of the Spelling Theorem using towers, a topological technique first used by Papakyriakopoulos to prove Dehn's Lemma and the Sphere Theorem. The proof, which is joint with Dani Wise, follows a technique outlined by Howie for proving results in one-relator group theory.

Date received: March 10, 1999

Copyright © 1999 by the author(s). The author(s) of this document and the organizers of the conference have granted their consent to include this abstract in Atlas Conferences Inc. Document # caca-67.