Solving permutation problems using rewriting systems

  • Cynthia Brown
  • Gene Cooperman
  • Larry Finkelstein
Computational Logic
Part of the Lecture Notes in Computer Science book series (LNCS, volume 358)


A new approach is described for finding short expressions for arbitrary elements of a permutation group in terms of the original generators which uses rewriting methods. This forms an important component in a long term plan to find short solutions for “large” permutation problems (such as Rubik's cube), which are difficult to solve by existing search techniques. In order for this methodology to be successful, it is important to start with a short presentation for a finite permutation group. A new method is described for giving a presentation for an arbitrary permutation group acting on n letters. This can be used to show that any such permutation group has a presentation with at most n – 1 generators and (n – 1)2 relations. As an application of this method, an O(n4) algorithm is described for determining if a set of generators for a permutation group on n letters is a strong generating set (in the sense of Sims). The “back end” includes a novel implementation of the Knuth-Bendix technique on symmetrization classes for groups.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    L. Babai, E. Luks, and A. Seress, “On Managing Permutation Groups in O(n 4logc n)”, Preprint No. 59/1986, Mathematical Institute of the Hungarian Academy of Sciences.Google Scholar
  2. 2.
    B. Benninghofen, S. Kemmerich, and M.M. Richter, Systems of Reductions Lecture Notes in Computer Science, 277, Springer-Verlag, Berlin, 1987.Google Scholar
  3. 3.
    C.A. Brown, G. Cooperman, L. Finkelstein, and P.W. Purdom, “Computation in Groups Using Labelled Branchings”, in preparation.Google Scholar
  4. 4.
    G. Cooperman and L.A. Finkelstein, “Short Presentations for Permutation Groups”, in preparation.Google Scholar
  5. 5.
    M. Jerrum, “A Compact Representation for Permutation Groups”, Journal of Algorithms 7 (1986), 60–78.Google Scholar
  6. 6.
    O. Knill and R.E. Mäder, “A Collection of Projects for the Mathematical Laboratory: The Rotation Group of Rubik's Cube”, ACM Sigsam Bulletin, Vol. 21, No. 3, August, 1987, 33–43.Google Scholar
  7. 7.
    D.E. Knuth, “Notes on Efficient Representation of Permutation Groups” (1981), unpublished manuscript.Google Scholar
  8. 8.
    D.E. Knuth and P.B. Bendix, “Simple Word Problems in Universal Algebras” In Computational Problems in Abstract Algebras, J. Leech, Ed., Pergamon Press, 1970, pp. 263–297.Google Scholar
  9. 9.
    D.E. Knuth, J.H. Morris, Jr. and V.R. Pratt, “Fast pattern matching in strings”, SIAM Journal on Computing, vol. 6, no, 2 (1977), 323–350.Google Scholar
  10. 10.
    R. Korf, Learning to Solve Problems by Searching for Macro-Operators, Pitman Publishing, Marshfield, Ma., 1985.Google Scholar
  11. 11.
    P. Le Chenadec, Canonical Forms in Finitely Presented Algebras, Pitman Publishing, London, 1986 (in U.S.A., J. Wiley & Sons, New York).Google Scholar
  12. 12.
    D. Ratner and M. Warmuth, “Finding a Shortest Solution for the N × N Extension of the 15-PUZZLE is Intractable”, Proc. AAAI-86, 1986, 168–172.Google Scholar
  13. 13.
    C.C. Sims, “Computation with Permutation Groups”, in Proc. Second Symposium on Symbolic and Algebraic Manipulation, edited by S.R. Petrick, ACM, New York, 1971.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Cynthia Brown
    • 1
  • Gene Cooperman
    • 1
  • Larry Finkelstein
    • 1
  1. 1.College of Computer ScienceNortheastern UniversityBoston

Personalised recommendations