On an algorithm for finding a base and a strong generating set for a group given by generating permutations
HTML articles powered by AMS MathViewer
- by Jeffrey S. Leon PDF
- Math. Comp. 35 (1980), 941-974 Request permission
Abstract:
This paper deals with the problem of finding a base and strong generating set for the group generated by a given set of permutations. The concepts of base and strong generating set were introduced by Sims [5], [6] and provide the most effective tool for computing with permutation groups of high degree. One algorithm, originally proposed by Sims [7], is described in detail; its behavior on a number of groups is studied, and the influence of certain parameters on its performance is investigated. Another algorithm, developed by the author, is given, and it is shown how the two algorithms may be combined to yield an exceptionally fast and effective method.References
- John J. Cannon, Lucien A. Dimino, George Havas, and Jane M. Watson, Implementation and analysis of the Todd-Coxeter algorithm, Math. Comp. 27 (1973), 463–490. MR 335610, DOI 10.1090/S0025-5718-1973-0335610-5
- John J. Cannon and George Havas, Defining relations for the Held-Higman-Thompson simple group, Bull. Austral. Math. Soc. 11 (1974), 43–46. MR 360795, DOI 10.1017/S0004972700043616
- Marshall Hall Jr., The theory of groups, The Macmillan Company, New York, N.Y., 1959. MR 0103215
- John McKay and David Wales, The multipliers of the simple groups of order $604,800$ and $50,232,960$, J. Algebra 17 (1971), 262–272. MR 274577, DOI 10.1016/0021-8693(71)90033-0
- Charles C. Sims, Determining the conjugacy classes of a permutation group, Computers in algebra and number theory (Proc. SIAM-AMS Sympos. Appl. Math., New York, 1970) SIAM-AMS Proc., Vol. IV, Amer. Math. Soc., Providence, R.I., 1971, pp. 191–195. MR 0338135 CHARLES C. SIMS, "Computation with permutation groups," in Proc. Second Sympos. Symbolic and Algebraic Manipulation, Assoc. Comput. Mach., New York, 1971. CHARLES C. SIMS, "Some algorithms based on coset enumeration," Unpublished notes, 1974.
- Charles C. Sims, Some group-theoretic algorithms, Topics in algebra (Proc. 18th Summer Res. Inst., Austral. Math. Soc., Austral. Nat. Univ., Canberra, 1978) Lecture Notes in Math., vol. 697, Springer, Berlin, 1978, pp. 108–124. MR 524367
- J. A. Todd, Abstract definitions for the Mathieu groups, Quart. J. Math. Oxford Ser. (2) 21 (1970), 421–424. MR 272878, DOI 10.1093/qmath/21.4.421 J. A. TODD & H. S. M. COXETER, "A practical method for enumerating cosets of a finite abstract group," Proc. Edinburgh Math. Soc., v. 5, 1936, pp. 26-34.
Additional Information
- © Copyright 1980 American Mathematical Society
- Journal: Math. Comp. 35 (1980), 941-974
- MSC: Primary 20-04; Secondary 20F05
- DOI: https://doi.org/10.1090/S0025-5718-1980-0572868-5
- MathSciNet review: 572868