An inductive schema for computing conjugacy classes in permutation groups

Butler, Greg

doi:10.1090/S0025-5718-1994-1208219-2

An inductive schema for computing conjugacy classes in permutation groups
HTML articles powered by AMS MathViewer

by Greg Butler PDF

Math. Comp. 62 (1994), 363-383 Request permission

Abstract:

An approach to computing the conjugacy classes of elements of large permutation groups is presented in detail, and a prototype implementation is described. The approach builds on recent efficient algorithms for computing conjugacy classes of p-groups, and for computing Sylow subgroups of large permutation groups. Classes of elements of composite order are determined by recursively analyzing quotients of centralizers of p-elements.

References

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
Gregory Butler, Computing normalizers in permutation groups, J. Algorithms 4 (1983), no. 2, 163–175. MR 699212, DOI 10.1016/0196-6774(83)90043-3
Gregory Butler, Effective computation with group homomorphisms, J. Symbolic Comput. 1 (1985), no. 2, 143–157. MR 818875, DOI 10.1016/S0747-7171(85)80011-0
Gregory Butler, A proof of Holt’s algorithm, J. Symbolic Comput. 5 (1988), no. 3, 275–283. MR 946583, DOI 10.1016/S0747-7171(88)80029-4

Computing a conditioned pc presentation of a soluble permutation group

Greg Butler and John J. Cannon, On Holt’s algorithm, J. Symbolic Comput. 15 (1993), no. 2, 229–233. MR 1218761, DOI 10.1006/jsco.1993.1016
Gregory Butler and John Cannon, Computing Sylow subgroups of permutation groups using homomorphic images of centralizers, J. Symbolic Comput. 12 (1991), no. 4-5, 443–457. Computational group theory, Part 2. MR 1146510, DOI 10.1016/S0747-7171(08)80097-1
John J. Cannon, An introduction to the group theory language, Cayley, Computational group theory (Durham, 1982) Academic Press, London, 1984, pp. 145–183. MR 760656
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
S. P. Glasby, Constructing normalisers in finite soluble groups, J. Symbolic Comput. 5 (1988), no. 3, 285–294. MR 946584, DOI 10.1016/S0747-7171(88)80030-0
S. P. Glasby and Michael C. Slattery, Computing intersections and normalizers in soluble groups, J. Symbolic Comput. 9 (1990), no. 5-6, 637–651. Computational group theory, Part 1. MR 1075428, DOI 10.1016/S0747-7171(08)80079-X
Marshall Hall Jr., The theory of groups, The Macmillan Company, New York, N.Y., 1959. MR 0103215
Christoph M. Hoffmann, Group-theoretic algorithms and graph isomorphism, Lecture Notes in Computer Science, vol. 136, Springer-Verlag, Berlin, 1982. MR 785006, DOI 10.1007/3-540-11493-9
D. F. Holt, The calculation of the Schur multiplier of a permutation group, Computational group theory (Durham, 1982) Academic Press, London, 1984, pp. 307–319. MR 760666
D. F. Holt, The computation of normalizers in permutation groups, J. Symbolic Comput. 12 (1991), no. 4-5, 499–516. Computational group theory, Part 2. MR 1146513, DOI 10.1016/S0747-7171(08)80100-9
B. Huppert, Endliche Gruppen. I, Die Grundlehren der mathematischen Wissenschaften, Band 134, Springer-Verlag, Berlin-New York, 1967 (German). MR 0224703
R. Laue, J. Neubüser, and U. Schoenwaelder, Algorithms for finite soluble groups and the SOGOS system, Computational group theory (Durham, 1982) Academic Press, London, 1984, pp. 105–135. MR 760654
Jeffrey S. Leon, On an algorithm for finding a base and a strong generating set for a group given by generating permutations, Math. Comp. 35 (1980), no. 151, 941–974. MR 572868, DOI 10.1090/S0025-5718-1980-0572868-5
M. Mecky and J. Neubüser, Some remarks on the computation of conjugacy classes of soluble groups, Bull. Austral. Math. Soc. 40 (1989), no. 2, 281–292. MR 1012835, DOI 10.1017/S0004972700004378
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
Helmut Wielandt, Finite permutation groups, Academic Press, New York-London, 1964. Translated from the German by R. Bercov. MR 0183775