Computing the Composition Factors of a Permutation Group in ...

Computing the Composition Factors of a Permutation Group in Polynomial Time Eugene M . Luks1 Department of Computer and Information Science University of Oregon Eugene, OR 97403 Abstract Given generators for a group of permutations, it is shown that generators for the subgroups in a composition series can be found in polynomial time. The procedure also yields permutation representations of the composition factors. 1) Research supported by National Science Foundation Grants DCR-8403745 and DCR-8609491

• properties of primitive permutation groups
• unions of cells
• permutation group
• normal subgroup
• polynomial time
• polynomial-time
• bz
• g.
• action
• group