Implementing some algorithms of kantor

  • Greg Butler
Submitted Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 539)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Atkinson, M.D. (1975): An algorithm for finding the blocks of a permutation group, Math. Comp., 29, pp.911–913.Google Scholar
  2. Butler, G. (1985): Effective computation with group homomorphisms, J. Symbolic Comp., 1, pp.143–157.Google Scholar
  3. Butler, G. (1986): Data structures and algorithms for cyclically extended Schreier vectors, Congressus Numerantum 52, 63–78.Google Scholar
  4. 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.Google Scholar
  5. 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.Google Scholar
  6. Butler, G., and Cannon, J.J. (1991a), On Holt's algorithm, to appear in J. Symbolic Computation.Google Scholar
  7. Butler, G., and Cannon, J.J. (1991b), Computing Sylow subgroups of permutation groups via homomorphic images of centralizers, to appear in J. Symbolic Computation.Google Scholar
  8. Cannon, J.J. (1984): An introduction to the group theory language, Cayley, in Atkinson (1984), pp.145–183.Google Scholar
  9. Glasby, S.P. (1988) Constructing normalisers in finite soluble groups, J. Symbolic Comp. 5, 285–294.Google Scholar
  10. Hall, Jr, M. (1959): The Theory of Groups, Macmillan, New York.Google Scholar
  11. Huppert, B. (1967): Endliche Gruppen I, Springer-Verlag, Berlin.Google Scholar
  12. Kantor, W.M. (1985): Sylow's theorem in polynomial-time, J. Comput. Syst. Sci. 30, 359–394. (Appendix)Google Scholar
  13. 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.Google Scholar
  14. Kantor, W.M. (1989): unpublished notes.Google Scholar
  15. 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.Google Scholar
  16. Palfy, L. (1982): A polynomial bound on the order of primitive soluble groups, J. Algebra 77, 127–137.Google Scholar
  17. Sims, C.C. (1990), Computing the order of a solvable permutation group, J. Symbolic Comp. 9, 699–705.Google Scholar
  18. Wielandt, H. (1964): Finite Permutation Groups, Academic Press, New York.Google Scholar
  19. Wolf, T.R. (1982): Solvable and nilpotent subgroups of GL(n, q m), Can. J. Math. 34, 1097–1111.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Greg Butler
    • 1
  1. 1.Centre Interuniversitaire en Calcul Mathématique Algébrique Department of Computer ScienceConcordia UniversityMontrealCanada

Personalised recommendations