Nearly Linear Time Algorithms for Permutation Groups: An Interplay between Theory and Practice

Acta Applicandae Mathematicae

Volumn 52, Issue 1-3, 1998, Pages 183-207

  Seress, Ákos ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

Computational group theory; Nonnumerical algorithms; Permutation groups

Indexed keywords

EID: 0007030778     PISSN: 01678019     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1005911125383     Document Type: Article

References (71)

1. Atkinson, M. D.: An algorithm for finding the blocks of a permutation group, Math. Comput. 29 (1975), 911-913.
2. Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite groups, Proc. 23rd ACM STOC, 1991, pp. 164-174.
3. Babai, L., Cooperman, G., Finkelstein, L., and Seress, Á.: Nearly linear time algorithms for permutation groups with a small base, Proc. 1991 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1991, pp. 200-209.
4. Babai, L., Cooperman, G., Finkelstein, L., Luks, E. M., and Seress, Á.: Fast Monte Carlo algorithms for permutation groups, J. Comput. Syst. Sci. 50 (1995), 296-308. Preliminary version appeared in Proc. 23rd ACM STOC, 1991, pp. 90-100.
5. Babai, L., Cooperman, G., Finkelstein, L., Luks, E. M., and Seress, Á.: Fast Monte Carlo algorithms for permutation groups, J. Comput. Syst. Sci. 50 (1995), 296-308. Preliminary version appeared in Proc. 23rd ACM STOC, 1991, pp. 90-100.
6. Babai, L., Kantor, W. M., and Luks, E. M.: Computational complexity and the classification of finite simple groups, Proc. 24th IEEE FOCS, 1983, pp. 162-171.
7. Babai, L., Luks, E. M., and Seress, Á.: Permutation groups in NC, Proc. 19th ACM STOC, 1987, pp. 409-420.
8. Babai, L., Luks, E. M., and Seress, Á.: Computing composition series of primitive groups, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, Amer. Math. Soc., Providence, 1993, pp. 1-16.
9. Babai, L., Luks, E. M., and Seress, Á.: Fast management of permutation groups I, SIAM J. Comput. 26 (1997), 1310-1342. Preliminary version appeared in Proc. 28th IEEE FOCS, 1988, pp. 272-282.
10. Babai, L., Luks, E. M., and Seress, Á.: Fast management of permutation groups I, SIAM J. Comput. 26 (1997), 1310-1342. Preliminary version appeared in Proc. 28th IEEE FOCS, 1988, pp. 272-282.
11. Babai, L., Luks, E. M., and Seress, Á.: Fast management of permutation groups II, in preparation.
12. Babai, L. and Moran, S.: Arthur-Merlin games: A randomized proof system and a hierarchy of complexity classes, J. Comput. Syst. Sci. 36 (1988), 254-276.
13. Babai, L. and Szemerédi, E.: On the complexity of matrix group problems I, Proc. 25th IEEE FOCS, 1984, pp. 229-240.
14. Beals, R.: Computing blocks of imprimitivity for small-base groups in nearly linear time, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, Amer. Math. Soc., Providence, 1993, pp. 17-26.
15. Beals, R.: An elementary algorithm for computing the composition factors of a permutation group, Proc. 1993 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1993, pp. 127-134.
16. Beals, R. and Babai, L.: Las Vegas algorithms for matrix groups, Proc. 34th FOCS, 1993, pp. 427-436.
17. Beals, R. and Seress, Á.: Structure forest and composition factors for small base groups in nearly linear time, Proc 24th ACM STOC, 1992, pp. 116-125.
18. Bosma, W. and Cannon, J.: A Handbook of Cayley Functions, Computer Algebra Group, Univ. Sydney, 1991.
19. Butler, G.: Computing in permutation and matrix groups II: backtrack algorithm, Math. Comput. 39 (1982), 671-680.
20. Butler, G. and Cannon, J.: Computing in permutation and matrix groups III: Sylow subgroups, J. Symbol. Comput. 8 (1989), 241-252.
21. Cannon, J. and Playoust, C.: An Introduction to MAGMA, School of Math. and Stat., Univ. Sydney, 1993.
22. Celler, F. and Leedham-Green, C.: A constructive recognition algorithm for the special linear group, to appear in Proc. of ATLAS Conference.
23. Cooperman, G. and Finkelstein, L.: A random base change algorithm for permutation groups, J. Symbol. Comput. 17 (1994), 513-528.
24. Cooperman, G., Finkelstein, L., and Luks, E. M.: Reduction of group constructions to point stabilizers, Proc. 1989 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1989, pp. 351-356.
25. Cooperman, G., Finkelstein, L., York, B., and Tselman, M.: Constructing permutation representations for large matrix groups, Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1994, pp. 134-138.
26. Dixon, J. D.: The solvable length of a solvable linear group, Math. Z. 107 (1968), 151-158.
27. Faradzev, I. A. and Klin, M. H.: Computer package for computations with coherent configurations, Proc. 1991 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1991, pp. 219-223.
28. Faradzev, I. A., Klin, M. H., and Muzichuk, M. E.: Cellular rings and groups of automorphisms of graphs, in: I. A. Faradzev, A. A. Ivanov, M. H. Klin, and A. J. Woldar (eds), Investigations in Algebraic Theory of Combinatorial Objects, Kluwer Acad. Publ., Dordrecht, 1994, pp. 1-152.
29. Fontet, M., Calcul de centralisateur d'un groupe de permutations, Bull. Soc. Math. France Mem. 49-50 (1977), 53-63.
30. Furst, M. L., Hopcroft, J., and Luks, E. M.: Polynomial time algorithms for permutation groups, Proc. 21st IEEE FOCS, 1980, pp. 36-41.
31. Garey, M. R., and Johnson, D. S.: Computers and Intractability, A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979.
32. Hall, M. Jr.: The Theory of Groups, Macmillan, New York, 1959.
33. Hoffmann, C. M.: Subcomplete generalizations of graph isomorphism, J. Comput. Syst. Sci. 25 (1982), 332-359.
34. Hulpke, A.: Zur Berechnung von Charaktertafeln, Diplomarbeit, RWTH Aachen, 1993.
35. Jerrum, M.: A compact representation for permutation groups, J. Algorithms 7 (1986), 60-78.
36. Kantor, W. M.: Polynomial-time algorithms for finding elements of prime order and Sylow subgroups, J. Algorithms 6 (1985), 478-514.
37. Kantor, W. M.: Sylow's theorem in polynomial time, J. Comput. Syst. Sci. 30 (1985), 359-394.
38. Kantor, W. M.: Finding Sylow normalizers in polynomial time, J. Algorithms 11 (1990), 523-563.
39. Kantor, W. M.: Random remarks on permutation group algorithms, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, Amer. Math. Soc., Providence, 1993, pp. 127-131.
40. Kantor, W. M. and Luks, E. M.: Computing in quotient groups, Proc. 22nd ACM STOC, 1990, pp. 524-563.
41. Kantor, W. M. and Seress, Á.: Black box classical groups, submitted.
42. Kantor, W. M. and Seress, Á.: Permutation group algorithms via black box recognition algorithms, to appear in Proc. of Groups-St. Andrews in Bath, 1997.
43. Leon, J.: On an algorithm for finding a base and strong generating set for a group given by a set of generating permutations, Math. Comput. 35 (1980), 941-974.
44. Leon, J.: Permutation group algorithms based on partitions, I: Theory and algorithms, J. Symbol. Comput. 12 (1991), 533-583.
45. Liebeck, M. W., Praeger, C. E., and Saxl, J.: On the O'Nan-Scott theorem for finite primitive permutation groups, J. Austral. Math. Soc. A 44 (1988), 389-396.
46. Luks, E. M.: Isomorphism of graphs of bounded valence can be tested in polynomial time, J. Comput. Syst. Sci. 25 (1982), 42-65.
47. Luks, E. M.: Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 (1987), 87-99.
48. Luks, E. M.: Permutation groups and polynomial-time computation, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, Amen Math. Soc., Providence, 1993, pp. 139-175.
49. Luks, E. M. and Seress, Á.: Computing the Fitting subgroup and solvable radical of small-base permutation groups in nearly linear time, in: L. Finkelstein and W. Kantor (eds), Groups and Computation II, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 28, Amen Math. Soc., Providence, 1997, pp. 169-181.
50. McKay, B.: Nauty Users Guide (Version 1.5), Tech. Rep. TR-CS-90-02, Dept. Comp. Sci., Austral. Nat. Univ., 1990.
51. Morje, P.: A nearly linear algorithm for Sylow subgroups of small-base permutation groups, Ph.D. Thesis, The Ohio State University, 1995.
52. Neumann, P. M.: Some algorithms for computing with finite permutation groups, in: E. F. Robertson and C. M. Campbell (eds), Proc. of Groups-St Andrews 1985, London Math. Soc. Lecture Note Ser. 121, Cambridge Univ. Press, 1987, pp. 59-92.
53. Parker, R.: The computer calculation of modular characters. (The Meat-Axe), in: M. Atkinson (ed.), Computational Group Theory, Academic Press, New York, 1984, pp. 267-274.
54. Pyber, L.: Asymptotic results for permutation groups, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11 Amen Math. Soc., Providence, 1993, pp. 197-219.
55. Rónyai, L.: Computing the structure of finite algebras, J. Symbol. Comput. 9 (1990), 355-373.
56. Rose, J.: Abnormal depth and hypereccentric length in finite soluble groups, Math. Z. 90 (1965), 29-40.
57. Schönert, M. et al.: GAP: Groups, Algorithms, and Programming, Lehrstuhl D für Mathematik, RWTH Aachen, 1994.
58. Schönert, M. and Seress, Á.: Finding blocks of imprimitivity in small-base groups in nearly linear time, Proc. 1994 ACM-SIGSAM Inter. Symp. on Symbolic and Algebraic Comp., 1994, pp. 154-157.
59. Scott, L. L.: Representations in characteristic p, Proc. Santa Cruz Conf. on Finite Groups, Amer. Math. Soc., Providence, 1980, pp. 319-322.
60. Seress, Á.: Permutation Group Algorithms, Cambridge Univ. Press, to appear.
61. Sims, C. C.: Computational methods in the study of permutation groups, in: J. Leech (ed.), Computational Problems in Abstract Algebra, Proc. Conf. Oxford, 1967, Pergamon, Oxford, 1970, pp. 169-183.
62. Sims, C. C.: Computation with permutation groups, in: S. R. Petrick (ed.), Proc. Second Symp. on Symbolic and Algebraic Manipulation, ACM, New York, 1971, pp. 23-28.
63. Sims, C. C.: The existence and uniqueness of Lyons' group, in: T. Hagen, M. P. Hale and E. E. Shult (eds), Finite Groups '72, Gainesville, Florida, 1972, North-Holland, Amsterdam, 1973, pp. 138-141.
64. Sims, C. C.: How to construct a baby monster, in: M. J. Collins (ed.), Finite Simple Groups II, Durham, 1978, Academic Press, New York, 1980, pp. 339-345.
65. Sims, C. C.: Computing the order of a solvable permutation group, J. Symbol. Comput. 9 (1990), 699-705.
66. Sims, C. C.: Computation with Finitely Presented Groups, Cambridge Univ. Press, 1994.
67. Soicher, L.: GRAPE: a system for computing with graphs and groups, in: L. Finkelstein and W. Kantor (eds), Groups and Computation, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 11, Amer. Math. Soc., Providence, 1993, pp. 287-291.
68. Theißen, H.: Eine Methode zur Normalisatorberechnung in Permutationsgruppen mit Anwendungen in der Konstruktion primitiver Gruppen, Ph.D. Thesis, RWTH Aachen, 1997.
69. Wielandt, H.: Finite Permutation Groups, Academic Press, New York, 1964.
70. Wielandt, H.: Permutation groups through invariant relations and invariant functions, Lecture Notes, The Ohio State University, 1969.
71. Zassenhaus, H.: personal communication to J. Neubüser, 1967.