A compact representation for permutation groups

  title={A compact representation for permutation groups},
  author={Mark Jerrum},
  journal={23rd Annual Symposium on Foundations of Computer Science (sfcs 1982)},
  • M. Jerrum
  • Published 3 November 1982
  • Mathematics
  • 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. 
On the diameter of permutation groups
We show that any group represented by generators that are cycles of bounded degree has O(n2) diameter, i.e., that the longest product of generators required to reach any permutation in the group is
The parallel complexity of the abelian permutation group membership problem
  • P. McKenzie, S. Cook
  • Mathematics
    24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
  • 1983
We show that the permutation group membership problem can be solved in depth (logn)3 on a Monte Carlo Boolean circuit of polynomial size in the restricted case in which the group is abelian. We also
On the length of subgroup chains in the symmetric group
  • L. Babai
  • Mathematics, Computer Science
  • 1986
It is proved that for n≥2, the length of every subgroup chain in Sn is at most 2n-3, which has applications to worst case complexity estimates for permutation group algorithms.
Fast management of permutation groups
Novel algorithms for computation in permutation groups are presented. They provide an order-of-magnitude improvement in the worst-case analysis of the basic permutation-group problems, including
Partitions and permutations
Fast Management of Permutation Groups I
New algorithms for permutation group manipulation result in an improvement of nearly an order of magnitude in the worst-case analysis for the fundamental problems of finding strong generating sets and testing membership.
Construction of Combinatorial Objects
The paper centers around algorithms for this topic and shows how to base them on the same idea, the homomorphism principle, and shows that forming Sims chains, using an algorithmic version of Burnside's table of marks, computing double coset representatives, and computing Sylow subgroups of automorphism groups can be explained in this way.
Fast Group Membership Using a Strong Generating Test for Permutation Groups
An algorithm is presented here which has an observed running time of O(n 4) for all permutations groups for which it has been tested and which has a new test for whether a set of generators is a strong generating set.
Minimum Bases for Permutation Groups: The Greedy Approximation
Zero-Knowledge Proofs of the Conjugacy for Permutation Groups
A perfect zero-knowledge proof system for recognition if two permutation groups are conjugate is designed.


Polynomial-time algorithms for permutation groups
It is demonstrated 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.
Generating Coset Representatives for Permutation Groups
  • L. Allison
  • Mathematics, Computer Science
    J. Algorithms
  • 1981
Isomorphism of graphs with bounded eigenvalue multiplicity
Two polynomial time algorithms are described which test isomorphism of undirected graphs whose eigenvalues have bounded multiplicity, if X and Y are graphs of eigenvalue multiplicity m.
The Transitive Reduction of a Directed Graph
It is shown that the time complexity of the best algorithm for finding the transitive reduction of a graph is the same as the time to compute the transitives closure of agraph or to perform Boolean matrix multiplication.
Data Structures and Algorithms
The basis of this book is the material contained in the first six chapters of the earlier work, The Design and Analysis of Computer Algorithms, and has added material on algorithms for external storage and memory management.
Computers in Algebra and Number Theory
With your huge library of various books, your search demand Computers In Algebra And Number Theory Download PDF may be saved in all digital forms such as for example ePub, PDF, and free with two
Backtrack Programming
A widely used method of efftcient search is examined in detail and its scope and methods are formulated in their full generality.