Computing normalizers in permutation groups☆
References (12)
The maximal subgroups of the sporadic simple group of Held
J. Algebra
(1981)Computational methods for permutation groups
An algorithm for finding the blocks of a permutation group
Math. Comp.
(1975)- et al.
Computing in permutation and matrix groups I: normal closure, commutator subgroup, series
Math. Comp.
(1982) 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 ComputationThe Transitive Groups of Degree Fourteen and Fifteen
1993, Journal of Symbolic ComputationPermutation group algorithms based on partitions, I: Theory and algorithms
1991, Journal of Symbolic ComputationThe computation of normalizers in permutation groups
1991, Journal of Symbolic ComputationComputing in permutation and matrix groups III: Sylow subgroups
1989, Journal of Symbolic ComputationA proof of Holt's algorithm
1988, Journal of Symbolic Computation
- ☆
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.
Copyright © 1983 Published by Elsevier Inc.