Abstract
Kantor developed several polynomial-time algorithms for soluble permutation groups that he thought could form the basis of implementations for practical use. In this paper, we resolve the implementation difficulties for the basic algorithm which finds a normal subgroup of prime index, and algorithms for computing Sylow subgroups, testing solvability, and constructing a subnormal series.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Atkinson, M.D. (1975): An algorithm for finding the blocks of a permutation group, Math. Comp., 29, pp.911–913.
Butler, G. (1985): Effective computation with group homomorphisms, J. Symbolic Comp., 1, pp.143–157.
Butler, G. (1986): Data structures and algorithms for cyclically extended Schreier vectors, Congressus Numerantum 52, 63–78.
Butler, G. (1990), Computing a conditioned pc presentation of a soluble permutation group, TR 392, Basser Department of Computer Science, University of Sydney, 5 pages.
Butler, G., and Cannon, J.J. (1982): Computing in permutation and matrix groups I: normal closure, commutator subgroup, series, Math. Comp., 39, pp.663–670.
Butler, G., and Cannon, J.J. (1991a), On Holt's algorithm, to appear in J. Symbolic Computation.
Butler, G., and Cannon, J.J. (1991b), Computing Sylow subgroups of permutation groups via homomorphic images of centralizers, to appear in J. Symbolic Computation.
Cannon, J.J. (1984): An introduction to the group theory language, Cayley, in Atkinson (1984), pp.145–183.
Glasby, S.P. (1988) Constructing normalisers in finite soluble groups, J. Symbolic Comp. 5, 285–294.
Hall, Jr, M. (1959): The Theory of Groups, Macmillan, New York.
Huppert, B. (1967): Endliche Gruppen I, Springer-Verlag, Berlin.
Kantor, W.M. (1985): Sylow's theorem in polynomial-time, J. Comput. Syst. Sci. 30, 359–394. (Appendix)
Kantor, W.M. (1988): Algorithms for Sylow p-subgroups and solvable groups, Computers in Algebra, M.C. Tangora (ed.), Marcel Dekker, New York, pp.77–90.
Kantor, W.M. (1989): unpublished notes.
Leon, J.S. (1980): On an algorithm for finding a base and strong generating set for a group given by generating permutations, Math. Comp., 35, pp.941–974.
Palfy, L. (1982): A polynomial bound on the order of primitive soluble groups, J. Algebra 77, 127–137.
Sims, C.C. (1990), Computing the order of a solvable permutation group, J. Symbolic Comp. 9, 699–705.
Wielandt, H. (1964): Finite Permutation Groups, Academic Press, New York.
Wolf, T.R. (1982): Solvable and nilpotent subgroups of GL(n, q m), Can. J. Math. 34, 1097–1111.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Butler, G. (1991). Implementing some algorithms of kantor. In: Mattson, H.F., Mora, T., Rao, T.R.N. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 1991. Lecture Notes in Computer Science, vol 539. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54522-0_98
Download citation
DOI: https://doi.org/10.1007/3-540-54522-0_98
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54522-4
Online ISBN: 978-3-540-38436-6
eBook Packages: Springer Book Archive