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}
}
  • M. Jerrum
  • Published 1982
  • Mathematics, Computer Science
  • 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)
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. 
View on IEEE
doi.org
72 Citations
Highly Influential Citations
3
Background Citations
11
Methods Citations
11

Topics from this paper

      72 Citations

      Citation Type

      Citation Type

      Generating Permutation Groups
      • 3
      The parallel complexity of the abelian permutation group membership problem
      • P. McKenzie, S. Cook
      • Mathematics, Computer Science
      • 24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
      • 1983
      • 25
      On the length of subgroup chains in the symmetric group
      • 49
      Fast management of permutation groups
      • L. Babai, E. Luks, Ákos Seress
      • Mathematics, Computer Science
      • [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science
      • 1988
      • 37
      • PDF
      Efficient representation of perm groups
      • D. Knuth
      • Mathematics, Computer Science
      • Comb.
      • 1991
      • 41
      • PDF
      Partitions and permutations
      • P. Cameron
      • Computer Science, Mathematics
      • Discret. Math.
      • 2005
      • 3
      • PDF
      Combinatorial Tools for Computational Group Theory
      • 29
      • PDF
      Fast Management of Permutation Groups I
      • 31
      • PDF
      Construction of Combinatorial Objects
      • 2
      Fast Group Membership Using a Strong Generating Test for Permutation Groups
      • 9
      • Highly Influenced
      ...
      1
      2
      3
      4
      5
      ...

      References

      SHOWING 1-10 OF 18 REFERENCES
      A Compact Representation for Permutation Groups
      • M. Jerrum
      • Mathematics, Computer Science
      • FOCS
      • 1982
      • 34
      Polynomial-time algorithms for permutation groups
      • 284
      • PDF
      Generating Coset Representatives for Permutation Groups
      • L. Allison
      • Mathematics, Computer Science
      • J. Algorithms
      • 1981
      • 5
      Lexicographic permutations with restrictions
      • D. Knuth
      • Computer Science, Mathematics
      • Discret. Appl. Math.
      • 1979
      • 7
      Isomorphism of graphs of bounded valence can be tested in polynomial time
      • E. Luks
      • Computer Science, Mathematics
      • 21st Annual Symposium on Foundations of Computer Science (sfcs 1980)
      • 1980
      • 518
      • PDF
      Computational methods in the study of permutation groups
      • 320
      Isomorphism of graphs with bounded eigenvalue multiplicity
      • 171
      Group-Theoretic Algorithms and Graph Isomorphism
      • C. Hoffmann
      • Mathematics, Computer Science
      • Lecture Notes in Computer Science
      • 1982
      • 232
      • PDF
      The Transitive Reduction of a Directed Graph
      • 649
      • PDF
      Data Structures and Algorithms
      • 2,134
      ...
      1
      2
      ...