Fundamental Algorithms for Permutation Groups

This is the first-ever book on computational group theory. It covers the fundamental algorithms for permutation groups, with emphasis on the details of data structures and implementation which make the algorithms effective when applied to realistic problems.

Inhalt
Group theory background.- List of elements.- Searching small groups.- Cayley graph and defining relations.- Lattice of subgroups.- Orbits and schreier vectors.- Regularity.- Primitivity.- Inductive foundation.- Backtrack search.- Base change.- Schreier-Sims method.- Complexity of the Schreier-Sims method.- Homomorphisms.- Sylow subgroups.- P-groups and soluble groups.- Soluble permutation groups.- Some other algorithms.