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 firstname.lastname@example.org providing details of the course you are teaching.
Permutation groups are one of the oldest topics in algebra. Their study has recently been revolutionized by new developments, particularly the Classification of Finite Simple Groups, but also relations with logic and combinatorics, and importantly, computer algebra systems have been introduced that can deal with large permutation groups. This text summarizes these developments, including an introduction to relevant computer algebra systems, sketch proofs of major theorems, and many examples of applying the Classification of Finite Simple Groups. It is aimed at beginning graduate students and experts in other areas, and grew from a short course at the EIDMA institute in Eindhoven.Read more
- Large number of exercises, many introducing material not easily available elsewhere
- Sketch proofs of major theorems indicating the flow of argument
- Many examples of applying the classification of finite simple groups
Reviews & endorsements
"...an up-to-date study about this subject that is mainly aimed at beginning graduate students. Its style is compact, and it is comprehensive, easy to read and capable of motivating its readers." Mathematical Reviews
Not yet reviewed
Be the first to review
Review was not posted due to profanity×
- Date Published: March 1999
- format: Paperback
- isbn: 9780521653787
- length: 232 pages
- dimensions: 229 x 152 x 13 mm
- weight: 0.32kg
- contains: 12 b/w illus. 120 exercises
- availability: Available
Table of Contents
1. General theory
2. Representation theory
3. Coherent configurations
4. The O'Nan-Scott theorem
5. Oligomorphic groups
Find resources associated with this titleYour search for '' returned .
Type Name Unlocked * Format Size
This title is supported by one or more locked resources. Access to locked resources is granted exclusively by Cambridge University Press to instructors whose faculty status has been verified. To gain access to locked resources, instructors should sign in to or register for a Cambridge user account.
Please use locked resources responsibly and exercise your professional discretion when choosing how you share these materials with your students. Other instructors may wish to use locked resources for assessment purposes and their usefulness is undermined when the source files (for example, solution manuals or test banks) are shared online or via social networks.
Supplementary resources are subject to copyright. Instructors are permitted to view, print or download these resources for use in their teaching, but may not change them or use them for commercial gain.
If you are having problems accessing these resources please contact email@example.com.
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.×