An algorithm for finding the blocks of a permutation group
HTML articles powered by AMS MathViewer
- by M. D. Atkinson PDF
- Math. Comp. 29 (1975), 911-913 Request permission
Abstract:
An efficient algorithm for finding the blocks of imprimitivity of a group from generating permutations is described and justified.References
- 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
Additional Information
- © Copyright 1975 American Mathematical Society
- Journal: Math. Comp. 29 (1975), 911-913
- MSC: Primary 20B05
- DOI: https://doi.org/10.1090/S0025-5718-1975-0367030-3
- MathSciNet review: 0367030