Abstract
This chapter has introduced the stabiliser chain, the inductive foundation of the powerful algorithms for handling large permutation groups. The representation of elements by their base image, and as a product of coset representatives is central to the power of these algorithms. They are applied here to the performance of the tasks of testing membership, writing elements as products of the strong generators, and the enumeration of all the elements of a group.
We have presented several examples. It is hoped the reader will use them in the study of these and later algorithms.
This is a preview of subscription content, log in via an institution.
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). Inductive foundation. 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_29
Download citation
DOI: https://doi.org/10.1007/3-540-54955-2_29
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