10% off all books and free delivery over £50
Buy from our bookstore and 25% of the cover price will be given to a school of your choice to buy more books. *15% of eBooks.

Permutation Group Algorithms

View All Editions (1)

The selected edition of this book is not available to buy right now.
Add To Wishlist
Write A Review

About

Permutation Group Algorithms Synopsis

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.

About This Edition

ISBN: 9780521661034
Publication date:
Author: Ákos Ohio State University Seress
Publisher: Cambridge University Press
Format: Hardback
Pagination: 274 pages
Series: Cambridge Tracts in Mathematics
Genres: Algebra
Mathematical theory of computation