Presentations of Groups

2nd Edition

Part of London Mathematical Society Student Texts

Author: D. L. Johnson, University of Nottingham

Date Published: May 1997
availability: Available
format: Paperback
isbn: 9780521585422

Rate & review

Paperback

Add to wishlist

Other available formats:
eBook

Looking for an inspection copy?

This title is not currently available for inspection. However, if you are interested in the title for your course we can consider offering an inspection copy. To register your interest please contact asiamktg@cambridge.org providing details of the course you are teaching.

Description

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.
- Revised edition of tried and tested graduate text
- Lively and interesting field
- Author well known for his teaching
Read more
Customer reviews

Not yet reviewed
Be the first to review

Log in to review

Review was not posted due to profanity
×

, create a review

(If you're not , sign out)

Please enter the right captcha value

Please enter a star rating.

Your review must be a minimum of 12 words.

How do you rate this item?

Reviews must contain at least 12 words about the product.

×

Product details
- 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.
Look Inside
Author
D. L. Johnson, University of Nottingham