The aim of this book is to provide an introduction to combinatorial group theory. Any reader who has completed first courses in linear algebra, group theory and ring theory will find this book accessible. The emphasis is on computational techniques but rigorous proofs of all theorems are supplied. This new edition has been revised throughout, including new exercises and an additional chapter on proving that certain groups are infinite.Read more
- Revised edition of tried and tested graduate text
- Lively and interesting field
- Author well known for his teaching
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Edition: 2nd Edition
- Date Published: May 1997
- format: Paperback
- isbn: 9780521585422
- length: 232 pages
- dimensions: 227 x 152 x 14 mm
- weight: 0.31kg
- availability: Available
Table of Contents
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.
Sorry, this resource is locked
Please register or sign in to request access. If you are having problems accessing these resources please email firstname.lastname@example.orgRegister Sign in
You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.Continue ×
Are you sure you want to delete your account?
This cannot be undone.
Thank you for your feedback which will help us improve our service.
If you requested a response, we will make sure to get back to you shortly.×