A compact representation for permutation groups
- 1 November 1982
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 126-133
- https://doi.org/10.1109/sfcs.1982.52
Abstract
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.Keywords
This publication has 7 references indexed in Scilit:
- Isomorphism of graphs with bounded eigenvalue multiplicityPublished by Association for Computing Machinery (ACM) ,1982
- Generating coset representatives for permutation groupsJournal of Algorithms, 1981
- Polynomial-time algorithms for permutation groupsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1980
- Lexicographic permutations with restrictionsDiscrete Applied Mathematics, 1979
- The Transitive Reduction of a Directed GraphSIAM Journal on Computing, 1972
- Computational methods in the study of permutation groups††This research was supported in part by the National Science Foundation.Published by Elsevier ,1970
- Backtrack ProgrammingJournal of the ACM, 1965