Inductive foundation

Permutation Groups
Part of the Lecture Notes in Computer Science book series (LNCS, volume 559)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Personalised recommendations