|
Organizers |
Fans, ladders, and the coherence of small cancellation groups
by
Jon McCammond
Texas A&M University
Coauthors: Dani Wise (Cornell University)
A group is called coherent if all of its finitely generated subgroups are also finitely presented. In this talk I will discuss how the combinatorial Gauss-Bonnet theorem can be used to prove improved versions of the usual small cancellation theorems. These stronger versions involve types of diagrams we call ladders and fans. These improved versions allow us to prove a coherence theorem for small cancellation groups which is, in a precise sense, optimal.
Date received: May 20, 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 # cada-10.