Advertisement

Primitivity

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

Abstract

This chapter has presented an algorithm for finding partitions of the points Ω that are invariant under the action of the group. The generators of the group provided enough information for this algorithm, which finds the finest invariant partition having two given points in the same subset. The algorithm presented is O (¦Ω¦2). The primitivity of a group can be determined using this algorithm in time O (¦Ω¦3).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Personalised recommendations