Synopses & Reviews
From the reviews: "This book (...) defines the boundaries of the subject now called combinatorial group theory. (...)it is a considerable achievement to have concentrated a survey of the subject into 339 pages. This includes a substantial and useful bibliography; (over 1100 ÄitemsÜ). ...the book is a valuable and welcome addition to the literature, containing many results not previously available in a book. It will undoubtedly become a standard reference." Mathematical Reviews, AMS, 1979
About the Author
Biography of Roger C. Lyndon Roger Lyndon, born on Dec. 18, 1917 in Calais (Maine, USA), entered Harvard University in 1935 with the aim of studying literature and becoming a writer. However, when he discovered that, for him, mathematics required less effort than literature, he switched and graduated from Harvard in 1939.
After completing his Master's Degree in 1941, he taught at Georgia Tech, then returned to Harvard in 1942 and there taught navigation to pilots while, supervised by S. MacLane, he studied for his Ph.D., awarded in 1946 for a thesis entitled The Cohomology Theory of Group Extensions.
Influenced by Tarski, Lyndon was later to work on model theory. Accepting a position at Princeton, Ralph Fox and Reidemeister's visit in 1948 were major influencea on him to work in combinatorial group theory. In 1953 Lyndon left Princeton for a chair at the University of Michigan where he then remained except for visiting professorships at Berkeley, London, Montpellier and Amiens.
Lyndon made numerous major contributions to combinatorial group theory. These included the development of "small cancellation theory", his introduction of "aspherical" presentations of groups and his work on length functions. He died on June 8, 1988.
Biography of Paul E. Schupp
Paul Schupp, born on March 12, 1937 in Cleveland, Ohio was a student of Roger Lyndon's at the Univ. of Michigan. Where he wrote a thesis on "Dehn's Algorithm and the Conjugacy Problem". After a year at the University of Wisconsin he moved to the University of Illinois where he remained. For several years he was also concurrently Visiting Professor at the University Paris VII and a member of the Laboratoire d'Informatique Théorique et Programmation (founded by M. P. Schutzenberger).
Schupp further developed the use of cancellation diagrams in combinatorial group theory, introducing conjugacy diagrams, diagrams on compact surfaces, diagrams over free products with amalgamation and HNN extensions and applications to Artin groups. He then worked with David Muller on connections between group theory and formal language theory and on the theory of finite automata on infinite inputs. His current interest is using geometric methods to investigate the computational complexity of algorithms in combinatorial group theory.
Table of Contents
Chapter I. Free Groups and Their Subgroups
1. Introduction 2. Nielsen's Method
3. Subgroups of Free Groups
4. Automorphisms of Free Groups
5. Stabilizers in Aut(F) 6. Equations over Groups
7. Quadratic sets of Word
8. Equations in Free Groups
9. Abstract Lenght Functions
10. Representations of Free Groups
11. Free Pruducts with Amalgamation
Chapter II. Generators and Relations
1. Introduction
2. Finite Presentations
3. Fox Calculus, Relation Matrices, Connections with Cohomology
4. The Reidemeister-Schreier Method
5. Groups with a Single Defining Relator
6. Magnus' Treatment of One-Relator Groups
Chapter III. Geometric Methods
1. Introduction
2. Complexes
3. Covering Maps
4. Cayley Complexes
5. Planar Caley Complexes
6. F-Groups Continued
7. Fuchsian Complexes
8. Planar Groups with Reflections
9. Singular Subcomplexes
10. Sherical Diagrams
11. Aspherical Groups
12. Coset Diagrams and Permutation Representations
13. Behr Graphs
Chpter IV. Free Products and HNN Extensions
1. Free Products
2. Higman-Neumann-Neumann Extensions and Free Products with Amalgamation
3. Some Embedding Theorems
4. Some Decision Problems
5. One-Relator Groups
6. Bipolar Structures
7. The Higman Embedding Theorem
8. Algebraically Closed Groups
Chapter V. Small Cancellation Theory
1. Diagrams
2. The Small Cancellation Hypotheses
3. The Basic Formulas
4. Dehn's Algorithm and Greendlinger's Lemma
5. The Conjugacy Problem
6. The Word Problem
7. The Cunjugacy Problme
8. Applications to Knot Groups
9. The Theory over Free Products
10. Small Cancellation Products
11. Small Cancellation Theory over free Products with Amalgamation and HNN Extensions
Bibliography
Index of Names
Subject Index