Polynomial-Time Algorithms for Permutation Groups

A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time. In addition, we demonstrate that the normal closure of a subgroup can be computed in polynomial time, and that this proceaure can be used to test a group for solvability. We also describe an approach to computing the intersection of two groups. The procedures and techniques have wide applicability and have recently been used to improve many graph isomorphism algorithms.

Authors

• Merrick L. Furst
• John E. Hopcroft
• Eugene M. Luks

Keywords

• Polynomials
• Testing
• Tin
• Computer science
• Algorithm design and analysis
• Mathematics
• Lagrangian functions
• Polynomial-time Algorithm
• Permutation Group
• Automorphism
• Collection Of Elements
• Graph Isomorphism
• Probabilistic Polynomial Time
• Group Elements
• Canonical Form