Skip to content
Register Sign in Wishlist
Permutation Group Algorithms

Permutation Group Algorithms

$124.95 (C)

Part of Cambridge Tracts in Mathematics

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

$ 124.95 (C)
Hardback

Add to cart Add to wishlist

Other available formats:
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 collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Permutation group algorithms are indispensable in the proofs of many deep results, including the construction and study of sporadic finite simple groups. This work describes the theory behind permutation group algorithms, up to the most recent 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. The book fills a significant gap in the symbolic computation literature for readers interested in using computers in group theory.

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

    Reviews & endorsements

    "This book provides a virtually complete state-of-the-art account of algorithms for computing with finite permutation groups. Almost all of the algorithms described are accompanied by complete and detailed correctness proofs and complexity analyses. It is very clearly written throughout, and is likely to become the standard and definitive reference work in the field." 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 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

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

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

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 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 ×

Continue ×

Continue ×

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.

Cancel

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.
×