A compact representation for permutation groups
@article{Jerrum1982ACR, title={A compact representation for permutation groups}, author={M. Jerrum}, journal={23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)}, year={1982}, pages={126-133} }
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.
Topics from this paper
71 Citations
The parallel complexity of the abelian permutation group membership problem
- Mathematics, Computer Science
- 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
- 1983
- 25
Fast management of permutation groups
- Mathematics, Computer Science
- [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
- 1988
- 37
- PDF
Combinatorial Tools for Computational Group Theory
- Mathematics, Computer Science
- Groups And Computation
- 1991
- 29
- PDF
Fast Group Membership Using a Strong Generating Test for Permutation Groups
- Mathematics, Computer Science
- Computers and Mathematics
- 1989
- 9
- Highly Influenced
References
SHOWING 1-10 OF 18 REFERENCES
Polynomial-time algorithms for permutation groups
- Computer Science
- 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
- 1980
- 284
- PDF
Generating Coset Representatives for Permutation Groups
- Mathematics, Computer Science
- J. Algorithms
- 1981
- 5
Isomorphism of graphs of bounded valence can be tested in polynomial time
- Computer Science, Mathematics
- 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
- 1980
- 514
- PDF
Isomorphism of graphs with bounded eigenvalue multiplicity
- Mathematics, Computer Science
- STOC '82
- 1982
- 170
Group-Theoretic Algorithms and Graph Isomorphism
- Mathematics, Computer Science
- Lecture Notes in Computer Science
- 1982
- 231
- PDF