Publications Meetings The Profession Membership Programs Math Samplings Policy & Advocacy In the News About the AMS

Remote Access
Green Open Access
Mathematics of Computation
Mathematics of Computation
ISSN 1088-6842(online) ISSN 0025-5718(print)


On an algorithm for finding a base and a strong generating set for a group given by generating permutations

Author: Jeffrey S. Leon
Journal: Math. Comp. 35 (1980), 941-974
MSC: Primary 20-04; Secondary 20F05
MathSciNet review: 572868
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

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 [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 20-04, 20F05

Retrieve articles in all journals with MSC: 20-04, 20F05

Additional Information

PII: S 0025-5718(1980)0572868-5
Article copyright: © Copyright 1980 American Mathematical Society

Comments: Email Webmaster

© Copyright , American Mathematical Society
Contact Us · Sitemap · Privacy Statement

Connect with us Facebook Twitter Google+ LinkedIn Instagram RSS feeds Blogs YouTube Podcasts Wikipedia