Presentations of Groups

Emphasizing computational techniques, this book provides an accessible and lucid introduction to combinatorial group theory. Rigorous proofs of all theorems and a light, informal style make Presentations of Groups a self-contained combinatorics class. Numerous and diverse exercises provide readers with a thorough overview of the subject. While catering to combinatorics beginners, this book also includes the frontiers of research, and explains software packages such as GAP, MAGMA, and QUOTPIC. This new edition has been revised throughout, including new exercises and an additional chapter on proving certain groups are infinite. Aimed at advanced undergraduates, this book will be a resource for graduate students and researchers.

1. Free groups; 2. Schreier's method; 3. Nielsen's method; 4. Free presentations of groups; 5. Some popular groups; 6. Finitely generated groups; 7. Finite groups with few relations; 8. Coset enumeration; 9. Presentations of subgroups; 10. Presentations of group extensions; 11. Relation models; 12. An algorithm for N/N'; 13. Finite p-groups; 14. The nilpotent quotient algorithm; 15. The Golod-Shafarevich theorem; 16. Fibonacci update.