Conjugacy classes in finite permutation groups via homomorphic images

Hulpke, Alexander

doi:10.1090/S0025-5718-99-01157-6

Conjugacy classes in finite permutation groups via homomorphic images
HTML articles powered by AMS MathViewer

by Alexander Hulpke PDF

Math. Comp. 69 (2000), 1633-1651 Request permission

Abstract:

The lifting of results from factor groups to the full group is a standard technique for solvable groups. This paper shows how to utilize this approach in the case of non-solvable normal subgroups to compute the conjugacy classes of a finite group.

References

Robert Beals and Ákos Seress, Structure forest and composition factors for small base groups in nearly linear time, Proceedings of the $24^{\mathrm {th}}$ ACM Symposium on Theory of Computing, ACM Press, 1992, pp. 116–125.
Gregory Butler and John J. Cannon, Computing in permutation and matrix groups. I. Normal closure, commutator subgroups, series, Math. Comp. 39 (1982), no. 160, 663–670. MR 669658, DOI 10.1090/S0025-5718-1982-0669658-3
Greg Butler, An inductive schema for computing conjugacy classes in permutation groups, Math. Comp. 62 (1994), no. 205, 363–383. MR 1208219, DOI 10.1090/S0025-5718-1994-1208219-2
John J. Cannon and Derek F. Holt, Computing chief series, composition series and socles in large permutation groups, J. Symbolic Comput. 24 (1997), no. 3-4, 285–301. Computational algebra and number theory (London, 1993). MR 1484480, DOI 10.1006/jsco.1997.0127
John Cannon and Bernd Souvignier, On the computation of conjugacy classes in permutation groups, Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (Wolfgang Küchlin, ed.), The Association for Computing Machinery, ACM Press, 1997, pp. 392–399.
John H. Conway, Alexander Hulpke, and John McKay, On transitive permutation groups, LMS J. Comput. Math. 1 (1998), 1–8. (electronic)
Gene Cooperman and Michael Tselman, Using tadpoles to reduce memory and communication requirements for exhaustive, breadth-first search using distributed computers, Proceedings of ACM Symposium on Parallel Architectures and Algorithms (SPAA-97), ACM Press, 1997, pp. 231–238.
Volkmar Felsch and Joachim Neubüser, An algorithm for the computation of conjugacy classes and centralizers in $p$-groups, Symbolic and algebraic computation (EUROSAM ’79, Internat. Sympos., Marseille, 1979) Lecture Notes in Comput. Sci., vol. 72, Springer, Berlin-New York, 1979, pp. 452–465. MR 575705
The GAP Group, School of Mathematical and Computational Sciences, University of St Andrews, and Lehrstuhl D für Mathematik, RWTH Aachen, GAP – Groups, Algorithms, and Programming, Version 4, 1998.
Daniel Gorenstein, Finite simple groups, University Series in Mathematics, Plenum Publishing Corp., New York, 1982. An introduction to their classification. MR 698782
Alexander Hulpke, Konstruktion transitiver Permutationsgruppen, Ph.D. thesis, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany, 1996.
Mark Jerrum, Computational Pólya theory, Surveys in combinatorics, 1995 (Stirling), London Math. Soc. Lecture Note Ser., vol. 218, Cambridge Univ. Press, Cambridge, 1995, pp. 103–118. MR 1358633, DOI 10.1017/CBO9780511662096.006
William M. Kantor and Eugene M. Luks, Computing in quotient groups, Proceedings of the $22^{\mathrm {nd}}$ ACM Symposium on Theory of Computing, Baltimore, ACM Press, 1990, pp. 524–563.
E. M. Luks, Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 (1987), no. 1, 87–99. MR 905155, DOI 10.1007/BF02579204
László Rédei, Endliche $p$-Gruppen, Akadémiai Kiadó, Budapest, 1989 (German). MR 992619
Peter M. Neumann, Some algorithms for computing with finite permutation groups, Proceedings of groups—St. Andrews 1985, London Math. Soc. Lecture Note Ser., vol. 121, Cambridge Univ. Press, Cambridge, 1986, pp. 59–92. MR 896501
R. A. Parker, The computer calculation of modular characters (the meat-axe), Computational group theory (Durham, 1982) Academic Press, London, 1984, pp. 267–274. MR 760660
Charles C. Sims, Determining the conjugacy classes of a permutation group, Computers in algebra and number theory (Proc. SIAM-AMS Sympos. Appl. Math., New York, 1970) SIAM-AMS Proc., Vol. IV, Amer. Math. Soc., Providence, R.I., 1971, pp. 191–195. MR 0338135
Charles C. Sims, Computing the order of a solvable permutation group, J. Symbolic Comput. 9 (1990), no. 5-6, 699–705. Computational group theory, Part 1. MR 1075432, DOI 10.1016/S0747-7171(08)80083-1
Heiko Theißen, Methoden zur Bestimmung der rationalen Konjugiertheit in endlichen Gruppen, Diplomarbeit, Lehrstuhl D für Mathematik, Rheinisch-Westfälische Technische Hochschule, Aachen, 1993.