Elsevier

Journal of Algorithms

Volume 4, Issue 2, June 1983, Pages 163-175
Journal of Algorithms

Computing normalizers in permutation groups

https://doi.org/10.1016/0196-6774(83)90043-3Get rights and content

First page preview

First page preview
Click to open first page preview

References (12)

  • Gregory Butler

    The maximal subgroups of the sporadic simple group of Held

    J. Algebra

    (1981)
  • Charles C Sims

    Computational methods for permutation groups

  • Michael D Atkinson

    An algorithm for finding the blocks of a permutation group

    Math. Comp.

    (1975)
  • Gregory Butler et al.

    Computing in permutation and matrix groups I: normal closure, commutator subgroup, series

    Math. Comp.

    (1982)
  • Gregory Butler

    Computing in permutation and matrix groups II: backtrack algorithm

    Math. Comp.

    (1982)
  • Gregory Butler and John J. Cannon, Computing in permutation and matrix groups III: Sylow subgroups,...
There are more references available in the full text version of this article.

Cited by (14)

  • Computing Sylow subgroups in permutation groups

    1997, Journal of Symbolic Computation
  • The Transitive Groups of Degree Fourteen and Fifteen

    1993, Journal of Symbolic Computation
  • The computation of normalizers in permutation groups

    1991, Journal of Symbolic Computation
  • A proof of Holt's algorithm

    1988, Journal of Symbolic Computation
View all citing articles on Scopus

Part of this work forms part of the author's Ph.D. thesis at the University of Sydney under Dr. J. J. Cannon. It was partially supported by the Australian Research Grants Committee and the National Research Council of Canada.

View full text