Computing maximal subgroups of finite groups

Journal of Symbolic Computation

Volumn 37, Issue 5, 2004, Pages 589-609

  Cannon, John ^a   Holt, Derek F ^b  

^a UNIVERSITY OF SYDNEY   (Australia)

^b UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1942541451     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jsc.2003.08.002     Document Type: Article

References (23)

1. Aschbacher, M., Scott, L., 1985. Maximal subgroups of finite groups. J. Algebra 92, 44-80.
2. Bosma, W., Cannon, J., Playoust, C., 1997. The MAGMA algebra system I: the user language. J. Symbolic Comput. 24, 235-265.
3. n using Goldbach's conjecture. J. Symbolic Comput. 29, 33-57.
4. Butler, G., 1991. Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science, vol. 559. Springer-Verlag, Berlin, Heidelberg, New York.
5. Cameron, P.J., 1999. Permutation Groups. London Math. Soc. Stud. Texts, vol. 45. Cambridge University Press, Cambridge.
6. Cannon, J.J., Cox, B., Holt, D.F., 2001. Computing the subgroups of a permutation group. J. Symbolic Comput. 31, 149-161.
7. Cannon, J.J., Holt, D.F., 2003. Automorphism group computation and isomorphism testing in finite groups. J. Symbolic Comput. 35, 241-267.
8. Cannon, J.J., Leedham-Green, C.R., 2003. Presentations of finite soluble groups (in preparation).
9. Cannon, J.J., Souvignier, B., 2003. On the computation of normal subgroups in permutation groups (in press).
10. Celler, F., Neubüser, J., Wright, C.R.B., 1990. Some remarks on the computation of complements and normalizers in soluble groups. Acta Applicandae Mathematicae 21, 57-76.
11. Easdown, D., Praeger, C.E., 1988. On minimal faithful permutation representations of finite groups. Bull. Aust. Math. Soc. 38, 207-220.
12. Eick, B., 1997. Special presentations for finite soluble groups and computing (pre-)Frattini subgroups. In: Kantor, W.M., Finkelstein, L. (Eds.), Groups and Computation II, Amer. Math. Soc. DIMACS Series, vol. 28. pp. 101-112 (DIMACS, 1995).
13. Eick, B., Hulpke, A., 1999, 2001. Computing the maximal subgroups of a permutation group I. In: Kantor, W.M., Seress, A., (Eds.), Groups and Computation III. Ohio, Walter de Gruyter, pp. 155-168.
14. Gross, F., Kovás, L.G., 1984. On normal subgroups which are direct products. J. Algebra 90, 133-168.
15. Holt, D.F., 1978a. Embeddings of group extensions into wreath products. Quart. J. Math. (Oxford) 29, 463-468.
16. Holt, D.F., 1978b. Representing quotients of permutation groups. Quart J. Math. (Oxford) 48, 347-350.
17. Hulpke, A., 1996. Konstruktion transitiver Permutationsgruppen. Ph.D. Thesis. RWTH Aachen.
18. Kantor, W.M., Seress, Á., 2001. Black box classical groups. Memoirs Amer. Math. Soc. 149, 708.
19. Kovács, L.G., 1986. Maximal subgroups in composite finite groups. J. Algebra 99, 114-131.
20. Neubüser, J., 1982. An elementary introduction to coset table methods in computational group theory. In: Groups - St Andrews 1981, London Mathematical Society Lecture Note Series, vol. 71. Cambridge University Press, Cambridge, pp. 1-45.
21. Seress, Á., 1997. An introduction to computational group theory. Notices Amer. Math. Soc. 44, 671-679.
22. Unger, W.R., 2003. Computing the solvable radical of a permutation group (in preparation).
23. Zassenhaus, H., 1948. Über einen Algorithmus zur Bestimmung der Raumgruppen. Comment. Math. Helvet. 21, 117-141.