Conjugacy classes in finite permutation groups via homomorphic images

Mathematics of Computation

Volumn 69, Issue 232, 2000, Pages 1633-1651

  Hulpke, Alexander ^a  

^a UNIVERSITY OF ST ANDREWS   (United Kingdom)

Author keywords

Algorithm; Conjugacy classes; Permutation group

Indexed keywords

EID: 0034395746     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-99-01157-6     Document Type: Article

References (33)

1. th ACM Symposium on Theory of Computing, ACM Press, 1992, pp. 116-125.
2. Gregory Butler, Computing in permutation and matrix groups II: Backtrack algorithms, Math. Comp. 39 (1982), no. 160, 671-670. MR 83k:20004b
3. Gregory Butler, Computing in permutation and matrix groups II: Backtrack algorithms, Math. Comp. 39 (1982), no. 160, 671-670. MR 83k:20004b
4. Greg[ory] Butler, An inductive scheme for computing conjugacy classes in permutation groups, Math. Comp. 62 (1994), no. 205, 363-383. MR 94c:20011
5. Greg[ory] Butler, An inductive scheme for computing conjugacy classes in permutation groups, Math. Comp. 62 (1994), no. 205, 363-383. MR 94c:20011
6. John Cannon and Derek Holt, Computing chief series, composition series and socles in large permutation groups, J. Symbolic Comput. 24 (1997), 285-301. MR 98m:20009
7. John Cannon and Derek Holt, Computing chief series, composition series and socles in large permutation groups, J. Symbolic Comput. 24 (1997), 285-301. MR 98m:20009
8. 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.
9. John H. Conway, Alexander Hulpke, and John McKay, On transitive permutation groups, LMS J. Comput. Math. 1 (1998), 1-8. (electronic) CMP 98:15
10. John H. Conway, Alexander Hulpke, and John McKay, On transitive permutation groups, LMS J. Comput. Math. 1 (1998), 1-8. (electronic) CMP 98:15
11. 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.
12. Volkmar Felsch and Joachim Neubüser, An algorithm for the computation of conjugacy classes and centralizers in p-groups, Symbolic and Algebraic Computation (Proceedings of EUROSAM 79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, 1979) (Edward W. Ng, ed.), Lecture Notes in Computer Science, 72, Springer, Heidelberg, 1979, pp. 452-465. MR 82d:20003
13. Volkmar Felsch and Joachim Neubüser, An algorithm for the computation of conjugacy classes and centralizers in p-groups, Symbolic and Algebraic Computation (Proceedings of EUROSAM 79, An International Symposium on Symbolic and Algebraic Manipulation, Marseille, 1979) (Edward W. Ng, ed.), Lecture Notes in Computer Science, 72, Springer, Heidelberg, 1979, pp. 452-465. MR 82d:20003
14. 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.
15. Daniel Gorenstein, Finite simple groups, Plenum Press, 1982. MR 84j:20002
16. Daniel Gorenstein, Finite simple groups, Plenum Press, 1982. MR 84j:20002
17. Alexander Hulpke, Konstruktion transitiver Permutationsgruppen, Ph.D. thesis, Rheinisch-Westfälische Technische Hochschule, Aachen, Germany, 1996.
18. Mark Jerrum, Computational Polya theory, Surveys in Combinatorics, 1995 (Stirling) (Peter Rowlinson, ed.), London Mathematical Society Lecture Note Series, vol. 218, Cambridge University Press, 1995, pp. 103-118. MR 96h:05012
19. Mark Jerrum, Computational Polya theory, Surveys in Combinatorics, 1995 (Stirling) (Peter Rowlinson, ed.), London Mathematical Society Lecture Note Series, vol. 218, Cambridge University Press, 1995, pp. 103-118. MR 96h:05012
20. nd ACM Symposium on Theory of Computing, Baltimore, ACM Press, 1990, pp. 524-563.
21. Eugene M. Luks, Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 (1987), 87-89. MR 89c:20007
22. Eugene M. Luks, Computing the composition factors of a permutation group in polynomial time, Combinatorica 7 (1987), 87-89. MR 89c:20007
23. M[atthias] Mecky and J[oachim] Neubüser, Some remarks on the computation of conjugacy classes of soluble groups, Bull. Austral. Math. Soc. 40 (1989), no. 2, 281-292. MR 90i:20001
24. M[atthias] Mecky and J[oachim] Neubüser, Some remarks on the computation of conjugacy classes of soluble groups, Bull. Austral. Math. Soc. 40 (1989), no. 2, 281-292. MR 90i:20001
25. Peter M. Neumann, Some algorithms for computing with finite permutation groups, Groups -St Andrews 1985 (Edmund F. Robertson and Colin M. Campbell, eds.), Cambridge University Press, 1986, pp. 59-92. R 89b:20004
26. Peter M. Neumann, Some algorithms for computing with finite permutation groups, Groups - St Andrews 1985 (Edmund F. Robertson and Colin M. Campbell, eds.), Cambridge University Press, 1986, pp. 59-92. R 89b:20004
27. Richard Parker, The Computer Calculation of Modular Characters (the MeatAxe), Computational Group Theory (Michael D. Atkinson, ed.), Academic Press, 1984, pp. 267-274. MR 85k:20041
28. Richard Parker, The Computer Calculation of Modular Characters (the MeatAxe), Computational Group Theory (Michael D. Atkinson, ed.), Academic Press, 1984, pp. 267-274. MR 85k:20041
29. Charles C. Sims, Determining the conjugacy classes of a permutation group, Computers in Algebra and Number Theory (Garrett Birkhoff and Marshall Hall Jr., eds.), SIAM-AMS Proc., vol. 4, American Mathematical Society, Providence, RI, 1971, pp. 191-195. MR 49:2901
30. Charles C. Sims, Determining the conjugacy classes of a permutation group, Computers in Algebra and Number Theory (Garrett Birkhoff and Marshall Hall Jr., eds.), SIAM-AMS Proc., vol. 4, American Mathematical Society, Providence, RI, 1971, pp. 191-195. MR 49:2901
31. _, Computing the order of a solvable permutation group, J. Symbolic Comput. 9 (1990), 699-705. MR 91m:20011
32. _, Computing the order of a solvable permutation group, J. Symbolic Comput. 9 (1990), 699-705. MR 91m:20011
33. 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.