An algorithm for finding the blocks of a permutation group
M. D. Atkinson
Math. Comp. 29 (1975), 911-913
Full-text PDF Free Access
Similar Articles |
Abstract: An efficient algorithm for finding the blocks of imprimitivity of a group from generating permutations is described and justified.
- Charles C. Sims, Computational methods in the study of permutation groups, Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967) Pergamon, Oxford, 1970, pp. 169–183. MR 0257203
C. C. SIMS, "Computational methods in the study of permutation groups," Computational Problems in Abstract Algebra (Proc. Conf., Oxford, 1967), Pergamon Press, Oxford, 1970, pp. 169-183. MR 41 #1856.
Retrieve articles in Mathematics of Computation
Retrieve articles in all journals
© Copyright 1975
American Mathematical Society