Computational complexity and the classification of finite simple groups

We address the graph isomorphism problem and related fundamental complexity problems of computational group theory. The main results are these: A1. A polynomial time algorithm to test simplicity and find composition factors of a given permutation group (COMP). A2. A polynomial time algorithm to find elements of given prime order p in a permutation group of order divisible by p. A3. A polynomial time reduction of the problem of finding Sylow subgroups of permutation groups (SYLFIND) to finding the intersection of two cosets of permutation groups (INT). As a consequence, one can find Sylow subgroups of solvable groups and of groups with bounded nonabelian composition factors in polynomial time. A4. A polynomial time algorithm to solve SYLFIND for finite simple groups. A5. An ncd/log d algorithm for isomorphism (ISO) of graphs of valency less than d and a consequent improved moderately exponential general graph isomorphism test in exp(c√n log n) steps. A6. A moderately exponential, n,c√n algorithm for INT. Combined with A3, we obtain an nc√n algorithm for SYLFIND as well. All these problems have strong links to each other. ISO easily reduces to INT. A subcase of SYLFIND was solved in polynomial time and applied to bounded valence ISO in [Lul]. Now, SYLFIND is reduced to INT. Interesting special cases of SYLFIND belong to NP ∩ coNP and are not known to have subexponential solutions. All the results stated depend on the classification of finite simple groups. We note that no previous ISO test had no(d) worst case behavior for graphs of valency less than d. It appears that unless there is another radical breakthrough in ISO, independent of the previous one, the simple groups classification is an indispensable tool for further developments.

[1]  P. Pálfy,et al.  A polynomial bound for the orders of primitive solvable groups , 1982 .

[2]  Claus-Peter Schnorr.  Refined Analysis and Improvements on Some Factoring Algorithms , 1982, J. Algorithms.

[3]  Robert Steinberg,et al.  Regular elements of semisimple algebraic groups , 1965 .

[4]  Richard Weiss,et al.  The nonexistence of 8-transitive graphs , 1981, Comb..

[5]  D. Gorenstein.  Finite Simple Groups: An Introduction to Their Classification , 1982 .

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

[7]  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).

[8]  Peter J. Cameron,et al.  On the orders of primitive groups with restricted nonabelian composition factors , 1982 .

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

[10]  J. Dixon.  Asymptotically fast factorization of integers , 1981 .

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

[12]  Charles C. Sims,et al.  Some group-theoretic algorithms , 1978 .

[13]  László Babai,et al.  On the order of doubly transitive permutation groups , 1982 .

[14]  John H. Conway.  Monsters and Moonshine , 1980 .

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

[16]  Peter J. Cameron,et al.  There are only finitely many finite distance-transitive graphs of given valency greater than two , 1982, Comb..

[17]  László Babai,et al.  Canonical labeling of graphs , 1983, STOC.

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