Carleton University
Technical Report TR-183
November 1990
A New Algorithm for Testing the Regularity of a Permutation Group
B.J. Oommen & J.R. Zgierski
Abstract
An algorithm is presented for testing whether the group G generated by a given set of m permutations of degree n is regular. The algorithm has a worst case time complexity of O(m2n). Then a probabilistic modification is.proposed which is designed to reduce the execution time in cases where the generating set is redundant. The group parameters which control the execution time of the modified algorithm are discussed.