Fast management of permutation groups I

SIAM Journal on Computing

Volumn 26, Issue 5, 1997, Pages 1310-1342

  Babai, László ^a,b   Luks, Eugene M ^c   Seress, Ákos ^d  

^a EÖTVÖS LORÁND UNIVERSITY   (Hungary)

^b THE UNIVERSITY OF CHICAGO   (United States)

^c UNIVERSITY OF OREGON   (United States)

^d OHIO STATE UNIVERSITY   (United States)

Author keywords

Permutation group algorithm; Strong generating set

Indexed keywords

EID: 0007031047     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539794229417     Document Type: Article

References (36)

1. M. D. ATKINSON, An algorithm for finding the blocks of a permutation group, Math. Comp., 29 (1975), pp. 911-913.
2. L. BABAI, On the order of uniprimitive permutation groups, Ann. of Math., 113 (1981), pp. 553-568.
3. L. BABAI, G. COOPERMAN, L. FINKELSTEIN, E. M. LUKS, AND Á. SERESS, Fast Monte Carlo algorithms for permutation groups, in Proc. 23rd ACM Symposium on the Theory of Computing, 1991, pp. 90-100.
4. L. BABAI, G. COOPERMAN, L. FINKELSTEIN, E. M. LUKS, AND Á. SERESS, Fast Monte Carlo algorithms for permutation groups, J. Comput. System Sci., 50 (1995), pp. 296-308.
5. L. BABAI, E. M. LUKS, AND Á. SERESS, Permutation groups in NC, in Proc. 19th ACM STOC, 1987, pp. 409-420.
6. L. BABAI, E. M. LUKS, AND Á. SERESS, Fast management of permutation groups, in Proc. 29th IEEE Foundations of Computer Science, 1988, pp. 272-282.
7. L. BABAI, E. M. LUKS, AND Á. SERESS, Computing composition series in primitive groups, in Groups and Computation, DIMACS Series in Discrete Mathematics 11, 1993, pp. 1-15.
8. L. BABAI, E. M. LUKS, AND Á. SERESS, Fast Management of Permutation Groups II, in preparation.
9. L. BABAI AND Á. SERESS, On the degree of transitivity of permutation groups: A short proof, J. Combinatorial Theory Ser. A, 45 (1987), pp. 310-315.
10. L. BABAI AND Á. SERESS, On the diameter of Cayley graphs of the symmetric group, J. Combin. Theory Ser. A, 49 (1988), pp. 175-179.
11. R. C. BOSE, Strongly regular graphs, partial geometries, and partially balanced designs, Pacific J. Math., 13 (1963), pp. 389-419.
12. C. BROWN, L. FINKELSTEIN, AND P. PURDOM, A new base change algorithm for permutation groups, SIAM J. Comput., 18 (1989), pp. 1037-1047.
13. P. J. CAMERON, Finite permutation groups and finite simple groups, Bull. London Math. Soc., 13 (1981), pp. 1-22.
14. R. CARTER, Simple Groups of Lie Type, Wiley, London, 1972.
15. C. W. CURTIS, W. M. KANTOR, AND G. L. SEITZ, The 2-transitive permutation representations of the finite Chevalley groups, Trans. Amer. Math. Soc., 218 (1976), pp. 1-57.
16. H. S. M. COXETER AND W. O. J. MOSER, Generators and Relations for Discrete Groups, 3rd ed., Springer-Verlag, New York, 1972.
17. P. DELSARTE, An algebraic approach to the association schemes of coding theory, Philips Research Report Supplement, 10 (1973).
18. M. L. FURST, J. HOPCROFT, AND E. M. LUKS, Polynomial time algorithms for permutation groups, in Proc. 21st IEEE Foundations of Computer Science, 1980, pp. 36-41.
19. D. GORENSTEIN, Finite Simple Groups and Their Classification, Academic Press, New York, 1986.
20. M. HALL, JR., The Theory of Groups, Macmillan, New York, 1959.
21. G. H. HARDY AND E. M. WEIGHT, An Introduction to the Theory of Numbers, 5th ed., Clarendon Press, Oxford, 1979.
22. M. JERRUM, A compact representation for permutation groups, in Proc. 23rd IEEE Foundations of Computer Science, 1982, pp. 126-133.
23. M. JERRUM, A compact representation for permutation groups, J. Algorithms, 7 (1986), pp. 60-78.
24. C. JORDAN, Nouvelles recherches sur la limite de transitivité des groupes qui ne contiennent pas le groupe alterné, Journ. de Mathématiques, 1 (1895), pp. 35-60.
25. D. E. KNUTH, Efficient representation of perm groups, Combinatorica, 11 (1991), pp. 33-44.
26. M. W. LlEBECK, On minimal degrees and base sizes of primitive groups, Arch. Math., 43 (1984), pp. 11-15.
27. E. M. LUKS, Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. System Sci., 25 (1982), pp. 42-65.
28. E. M. LUKS, Parallel algorithms for permutation groups and graph isomorphism, in Proc. 27th IEEE Foundations of Computer Science, 1986, pp. 292-302.
29. E. M. LUKS, Computing the composition factors of a permutation group in polynomial time, Combinatorica, 7 (1987), pp. 87-99.
30. F. J. MACWILLIAMS AND N. J. A. SLOANE, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1978.
31. L. PYBER, On the orders of doubly transitive permutation groups, elementary estimates, J. Combin. Theory Ser. A, 62 (1993), pp. 361-366.
32. A. SCHÖNHAGE AND V. STRASSEN, Schnelle Multiplikation Großer Zahlen, Computing, 7 (1971), pp. 281-292.
33. L. L. SCOTT, Representations in characteristic p, in Proc. Santa Cruz Conf. on Finite Groups, AMS, Providence, RI, 1980, pp. 319-322.
34. C. C. SIMS, Graphs and finite permutation groups, Math. Z., 95 (1967), pp. 76-86.
35. C. C. SIMS, Computational methods in the study of permutation groups, in Computational Problems in Abstract Algebra, J. Leech, ed., Pergamon Press, Elmsford, NY, 1970, pp. 169-183.
36. H. WIELANDT, Finite Permutation Groups, Academic Press, New York, 1964.