Fast Management of Permutation Groups I

We present new algorithms for permutation group manipulation. Our methods result in an improvement of nearly an order of magnitude in the worst-case analysis for the fundamental problems of finding strong generating sets and testing membership. The normal structure of the group is brought into play even for such elementary issues. An essential element is the recognition of large alternating composition factors of the given group and subsequent extension of the permutation domain to display the natural action of these alternating groups. Further new features include a novel fast handling of alternating groups and the sifting of defining relations in order to link these and other analyzed factors with the rest of the group. The analysis of the algorithm depends on the classification of finite simple groups. In a sequel to this paper, using an enhancement of the present method, we shall achieve a further order of magnitude improvement.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  László Pyber,et al.  On the Orders of Doubly Transitive Permutation Groups, Elementary Estimates , 1993, J. Comb. Theory, Ser. A.

[3]  H. Coxeter,et al.  Generators and relations for discrete groups , 1957 .

[4]  John E. Hopcroft,et al.  Polynomial-time algorithms for permutation groups , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[5]  László Babai,et al.  Permutation groups in NC , 1987, STOC '87.

[6]  L. Babai.  On the Order of Uniprimitive Permutation Groups , 1981 .

[7]  László Babai,et al.  Bounds on the diameter of Cayley graphs of the symmetric group , 1988, Journal of Algebraic Combinatorics.

[8]  László Babai,et al.  Computing Composition Series in Primitive Groups , 1991, Groups And Computation.

[9]  László Babai,et al.  Fast Monte Carlo algorithms for permutation groups , 1991, STOC '91.

[10]  D. Gorenstein.  Finite simple groups and their classification , 1974 .

[11]  László Babai,et al.  Fast management of permutation groups , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[12]  Eugene M. Luks.  Isomorphism of Graphs of Bounded Valence Can Be Tested in Polynomial Time , 1980, FOCS.

[13]  Donald E. Knuth.  Efficient representation of perm groups , 1991, Comb..

[14]  I. G. MacDonald,et al.  Lectures on Lie Groups and Lie Algebras: Simple groups of Lie type , 1995 .

[15]  R. C. Bose.  Strongly regular graphs, partial geometries and partially balanced designs. , 1963 .

[16]  Mark Jerrum,et al.  A compact representation for permutation groups , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[17]  E. Wright,et al.  An Introduction to the Theory of Numbers , 1939 .

[18]  Eugene M. Luks,et al.  Parallel algorithms for permutation groups and graph isomorphism , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[19]  H. Wielandt,et al.  Finite Permutation Groups , 1964 .

[20]  W. Kantor,et al.  The 2-transitive permutation representa-tions of the finite Chevalley groups , 1976 .

[21]  C. Sims.  Computational methods in the study of permutation groups , 1970 .

[22]  Paul Walton Purdom,et al.  A New Base Change Algorithm for Permutation Groups , 1989, SIAM J. Comput..

[23]  Charles C. Sims,et al.  Graphs and finite permutation groups , 1967 .

[24]  Martin W. Liebeck.  On minimal degrees and base sizes of primitive permutation groups , 1984 .

[25]  László Babai,et al.  On the degree of transitivity of permutation groups: A short proof , 1987, J. Comb. Theory, Ser. A.

[26]  P. Cameron.  FINITE PERMUTATION GROUPS AND FINITE SIMPLE GROUPS , 1981 .

[27]  M. Hall.  The Theory Of Groups , 1959 .

[28]  Mike D. Atkinson,et al.  An algorithm for finding the blocks of a permutation group , 1975 .

[29]  Eugene M. Luks.  Computing the composition factors of a permutation group in polynomial time , 1987, Comb..