Permutation groups in NC

We show that the basic problems of permutation group manipulation admit efficient parallel solutions. Given a permutation group G by a list of generators, we find a set of NC-efficient strong generators in NC. Using this, we show, that the following problems are in NC: membership in G; determining the order of G; finding the center of G; finding a composition series of G along with permutation representations of each composition factor. Moreover, given G, we are able to find the pointwise stabilizer of a set in NC. One consequence is that isomorphism of graphs with bounded multiplicity of eigenvalues is in NC. The analysis of the algorithms depends, in several ways, on consequences of the classification of finite simple groups.

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

[2]  Stephen A. Cook,et al.  The Classifikation of Problems which have Fast Parallel Algorithms , 1983, FCT.

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

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

[5]  K. Mulmuley.  A fast parallel algorithm to compute the rank of a matrix over an arbitrary field , 1987, Comb..

[6]  Pierre McKenzie,et al.  Fast parallel computation with permutation groups , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

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

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

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

[10]  R. Heller,et al.  © Macmillan , 1977 .

[11]  Nicholas Pippenger,et al.  On simultaneous resource bounds , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[13]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[14]  László Babai,et al.  A Las Vegas - NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[15]  Stephen A. Cook,et al.  The parallel complexity of the abelian permutation group membership problem , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

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

[17]  William M. Kantor.  Permutation Representations of the Finite Classical Groups of Small Degree or Rank , 1979 .

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

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

[20]  Endre Szemerédi,et al.  On the Complexity of Matrix Group Problems I , 1984, FOCS.

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

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

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

[24]  David M. Mount,et al.  Isomorphism of graphs with bounded eigenvalue multiplicity , 1982, STOC '82.

[25]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[26]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[27]  William M. Kantor,et al.  Sylow's Theorem in Polynomial Time , 1985, J. Comput. Syst. Sci..