Permutation Group Algorithms
1st Edition
Published on 2. December 2004
978-0-511-06016-8 (ISBN)
Description
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.
Reviews / Votes
'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 fuer 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, OxfordMore details
Series
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
Professional and scholarly
Illustrations
Worked examples or Exercises; 30 Line drawings, unspecified
File size
1,83 MB
ISBN-13
978-0-511-06016-8 (9780511060168)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Akos Seress
Permutation Group Algorithms
Book
03/2003
Cambridge University Press
€154.00
Shipment within 15-20 days
Person
Content
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.
