A Compact Representation for Permutation Groups

An O(n2) space representation for permutation groups of degree n is presented. The representation can be constructed in time O(n5), and supports fast membership testing. Applications of the representation to the generation of systems of coset representatives, and of complete block systems, are discussed.

Authors

• Mark Jerrum

Keywords

• Testing
• Computer science
• Glands
• Computer applications
• Performance evaluation
• Polynomials
• Compact Representation
• Permutation Group
• Representative Group
• Groups In Order
• Representation Of System
• Part Of The Solution
• Symmetry Group
• Binary Tree
• Recursive Algorithm
• Loop Iteration
• Dynamic Programming Approach
• Multigraph
• Balanced Tree
• Elements Sn
• Vertex Labels
• Edge Labels