Permutation Group Algorithms Based on Partitions, I: Theory and Algorithms

A technique for computing in permutation groups of high degree is developed. The technique uses the idea of successive refinement of ordered partitions, introduced by B. McKay in connection with the graph isomorphism problem, to supplement the techniques of base and strong generating set developed earlier by Sims. Applications to a number of specific problems in computational group theory are presented.