Automorphism group computation and isomorphism testing in finite groups

Journal of Symbolic Computation

Volumn 35, Issue 3, 2003, Pages 241-267

  Cannon, John J ^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: 0037339399     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(02)00133-5     Document Type: Review

References (30)

1. Bosma, W., Cannon, J.J., 1992. Structural computation in finite permutation groups. CWI-Q. 5, 127-160.
2. Bosma, W., Cannon, J.J. (Eds.), 2002a. Groups, Databases of Groups, Database of Almost-Simple Groups, pp. 639-642 (Chapter 22). In Bosma and Cannon (2002b). Handbook of Magna Functions, 2.9 ed., Or select 'groups', 'databases of groups', 'database of almost-simple groups' on the web site.
3. Bosma, W., Cannon, J.J. (Eds.), 2002b. Handbook of Magma Functions, 2.9 ed. School of Mathematics and Statistics, University of Sydney. Available from: http://magma.maths.usyd.edu.au/magma/htmlhelp/MAGMA.htm.
4. Bosma, W., Cannon, J.J., Playoust, C., 1997. The Magma algebra system I: the user language. J. Symb. Comput. 24, 235-265.
5. Butler, G., 1991. Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science, vol. 559, Springer-Verlag, New York.
6. Cannon, J.J., 1984. An introduction to the group theory language Cayley. In: Atkinson, M.D. (Ed.), Computational Group Theory, Academic Press, London, pp. 145-183.
7. Cannon, J.J., Cox, B., Holt, D.F., 2001. Computing the subgroup lattice of a permutation group. J. Symb. Comput. 31, 149-161.
8. Cannon, J.J., Holt, D.F., 1997. Computing chief series, composition series and socles in large permutation groups. J. Symb. Comput. 24, 285-302.
9. Conway, J.H., Curtis, R.T., Norton, S.P., Parker, R.A., Wilson, R.A., 1985. Atlas of Finite Groups: Maximal Subgroups and Ordinary Characters for Simple Groups, Clarendon Press, Oxford.
10. Easdown, D., Praeger, C.E., 1988. On minimal faithful permutation representations of finite groups. Bull. Aust. Math. Soc. 38, 207-220.
11. Eick, B., Leedham-Green, C.R., O'Brien, E.A., 2002. Constructing automorphism groups of p-groups. Commun. Alg. 30 (5), 2271-2295.
12. Felsch, V., Neubüser, J., 1968. Über ein Programm zur Berechnung der Automorphismengruppe einer endlichen Gruppe. Numer. Math. 11, 277-292.
13. Felsch, V., Neubüser, J., 1970. On a programme for the determination of the automorphism group of a finite group. In: Leech, J. (Ed.), Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), Pergamon, Oxford, pp. 59-60.
14. Gross, F., Kovács, L.G., 1984. On normal subgroups which are direct products. J. Algebra 90, 133-168.
15. Holt, D.F., 1997. Representing quotients of permutation groups. Q. J. Math. (Oxford) 48, 347-350.
16. Holt, D.F., Rees, S., 1994. Testing modules for irreducibility. J. Aust. Math. Soc. A 57, 1-16.
17. Hulpke A., 1996. Konstruktion transitiver Permutationsgruppen, Aachener Beiträge zur Mathematik, Band, vol. 18. Verlag der Augustinus Buchhandlung, Aachen. Ph.D, Thesis, RWTH Aachen.
18. Kantor W.M., Luks E.M., 1990. Computing in quotient groups. Proceedings of the 22nd ACM STOC. pp. 524-563.
19. Luks, E., Seress, Á., 1997. Computing the Fitting subgroup and solvable radical of small-base permutation groups in nearly linear time. In: Finkelstein, L., Kantor, W.M. (Eds.), Groups and Computation, II (New Brunswick, NJ, 1995), DIMACS Ser. Discrete Math. Theor. Comput. Sci., vol. 28, American Mathematical Society, Providence, RI, pp. 169-181.
20. Neubüser, J., 1982. An elementary introduction to coset table methods in finitely presented group theory. In: Campbell, C.M., Robertson, E.F. (Eds.), Groups-St Andrews 1981 London Mathematical Society Lecture Note Series, vol. 71, Cambridge University Press, Cambdridge, pp. 1-45.
21. O'Brien, E.A., 1995. Computing automorphisms of p-groups, In: Bosma, W., van Poorten, A.J. (Eds.), Computational Algebra and Number Theory, Proceedings of CANT' 92, Kluwer, pp. 83-90.
22. Robertz H., 1976. Eine Methode zur Berechnung der Automorphismengruppe einer endlichen Gruppe. Diplomarbeit, RWTH Aachen.
23. Rotman, J.J., 1995. An Introduction to the Theory of Groups. Graduate Texts in Mathematics, vol. 148, fourth ed, Springer-Verlag, New York.
24. Schneider, G.J.A., 1990. Computing with modular representations. J. Symb. Comput. 9.
25. Schönert, M., et al. 1995. GAP-Group, Algorithms and Programming, Lehrstuhl D fur̈ Mathematik, RWTH, Aachen.
26. Schwingel R., 2000. Two Matrix Group Algorithms with Applications to Computing the Automorphism Group of a Finite p-Group, Ph.D. Thesis, Queen Mary and Westfield College, University of London.
27. Sims, C.C., 1997. Computing with subgroups of automorphism groups of finite groups. In: Küchlin, W. (Ed.), Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation, ISSAC'97, ACM Press, pp. 400-403.
28. Smith M.J., 1995. Computing Automorphisms of Finite Soluble Groups. Ph.D. Thesis, Australian National University.
29. Unger W.R., 2003. Computing the solvable radical of a permutation group (in preparation).
30. Wilson, R.A., 1996. Standard generators for sporadic simple groups. J. Algebra 184, 505-515.