Abstract
The Schreier-Sims method produces a base and strong generating set of a group given by generators. It does this by verifying that all the Schreier generators can be expressed in terms of coset representatives.
There are several variations on the Schreier-Sims method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(1991). Schreier-Sims method. In: Butler, G. (eds) Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science, vol 559. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54955-2_32
Download citation
DOI: https://doi.org/10.1007/3-540-54955-2_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54955-0
Online ISBN: 978-3-540-46607-9
eBook Packages: Springer Book Archive