Permutation Group Algorithms (Cambridge Tracts in Mathematics) by Ákos Seress
Cambridge University Press; 1 edition | March 17, 2003 | English | ISBN: 052166103X | 274 pages | PDF | 1 MB
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.