Skip to content
Register Sign in Wishlist
Permutation Group Algorithms

Permutation Group Algorithms


Part of Cambridge Tracts in Mathematics

  • Date Published: May 2003
  • availability: Available
  • format: Hardback
  • isbn: 9780521661034

£ 111.00

Add to cart Add to wishlist

Other available formats:

Looking for an inspection copy?

This title is not currently available on inspection

Product filter button
About the Authors
  • Permutation group algorithms are one of the workhorses of symbolic algebra systems computing with groups. They played an indispensable role in the proof of many deep results, including the construction and study of sporadic finite simple groups. This book describes the theory behind permutation group algorithms, including developments based on the classification of finite simple groups. Rigorous complexity estimates, implementation hints, and advanced exercises are included throughout. The central theme is the description of nearly linear time algorithms, which are extremely fast both in terms of asymptotic analysis and of practical running time. A significant part of the permutation group library of the computational group algebra system GAP is based on nearly linear time algorithms. The book fills a significant gap in the symbolic computation literature. It is recommended for everyone interested in using computers in group theory, and is suitable for advanced graduate courses.

    • Makes use of the computational group algebra system GAP
    • Based on the author's own courses
    • Covers very recent developments
    Read more

    Reviews & endorsements

    'The book will be an invaluable tool for anyone who is interested in permutation groups, computational group theory or the broader area of computations involving symmetries and deserves a space on the shelf of any researcher in these areas.' Zentralblatt für Mathematik

    '… this monograph by Akos Seress, one of the leaders in the field, is a welcome contribution. … the monograph is welcome not only for giving us an encyclopaedic account of the area, but also for its timeliness. A good author of a good book stamps his or her tastes and expertise firmly on the pages. That is what has happened here. In particular, because it should be of lasting value, it is a very appropriate addition to the Cambridge Tracts.' Peter M. Neumann, The Queen's College, Oxford

    See more 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: May 2003
    • format: Hardback
    • isbn: 9780521661034
    • length: 274 pages
    • dimensions: 231 x 157 x 23 mm
    • weight: 0.52kg
    • contains: 30 b/w illus.
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Black-box groups
    3. Permutation groups: a complexity overview
    4. Bases and strong generating sets
    5. Further low-level algorithms
    6. A library of nearly linear time algorithms
    7. Solvable permutation groups
    8. Strong generating tests
    9. Backtrack methods
    10. Large-base groups.

  • Author

    Ákos Seress, Ohio State University

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.