Skip to content
Register Sign in Wishlist

Computation with Finitely Presented Groups

$85.99 (C)

Part of Encyclopedia of Mathematics and its Applications

  • Date Published: March 2010
  • availability: Available
  • format: Paperback
  • isbn: 9780521135078

$ 85.99 (C)

Add to cart Add to wishlist

Other available formats:
Hardback, eBook

Looking for an examination copy?

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

Product filter button
About the Authors
  • The book describes methods for working with elements, subgroups, and quotient groups of a finitely presented group. The author emphasizes the connection with fundamental algorithms from theoretical computer science, particularly the theory of automata and formal languages, from computational number theory, and from computational commutative algebra. The LLL lattice reduction algorithm and various algorithms for Hermite and Smith normal forms are used to study the Abelian quotients of a finitely presented group. The work of Baumslag, Cannonito, and Miller on computing non-Abelian polycyclic quotients is described as a generalization of Buchberger's Gröbner basis methods to right ideals in the integral group ring of a polycyclic group.

    • Comprehensive text presenting fundamental algorithmic ideas which have been developed to compute with finitely presented groups
    • Emphasises connection with fundamental algorithms from theoretical computer science
    • Comprehensive, yet accessible to graduate students
    Read more

    Reviews & endorsements

    "this book is a very interesting treatment of the computational aspects of combinatorial group theory. It is well-written, nicely illustrating the algorithms presented with many examples. Also, some remarks on the history of the field are included. In adition, many exercises are provided throughout...this is a very valuable book that is well-suited as a textbook for a graduate course on computational group theory. It addresses students of mahtematics and of computer science alike, providing the necessary background for both. In addition, this book will be of good use as a reference source for computational aspects of combinatorial group theory." Friedrich Otto, Mathematical Reviews

    Customer reviews

    Not yet reviewed

    Be the first 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?


    Product details

    • Date Published: March 2010
    • format: Paperback
    • isbn: 9780521135078
    • length: 624 pages
    • dimensions: 234 x 156 x 32 mm
    • weight: 0.86kg
    • availability: Available
  • Table of Contents

    1. Basic concepts
    2. Rewriting systems
    3. Automata and rational languages
    4. Subgroups of free products of cyclic groups
    5. Coset enumeration
    6. The Reidemeister-Schreier procedure
    7. Generalized automata
    8. Abelian groups
    9. Polycyclic groups
    10. Module bases
    11. Quotient groups.

  • Author

    Charles C. Sims, Rutgers University, New Jersey

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner Please see the permission section of the catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×
warning icon

Turn stock notifications on?

You must be signed in to your Cambridge account to turn product stock notifications on or off.

Sign in Create a Cambridge account arrow icon

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

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.

Please fill in the required fields in your feedback submission.