ENGLISH

Permutation Group Algorithms

By Akos Seress

Book information

Publisher
Cambridge University Press
Year
2002
ISBN
052166103X, 9780521661034, 9780511066474
Google Books ID
hxFqdbfc_CMC
Open Library ID
OL18141075M
Language
english
Format
PDF
Filesize
2 MB (1677304 bytes)
Series
Cambridge Tracts in Mathematics 152
Edition
1
Pages
274\274
Scanned
yes
Time added
2011-06-04 13:46:07

Description

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.

Similar books