Combinatorica

, Volume 11, Issue 1, pp 33–43

Efficient representation of perm groups

  • Donald E. Knuth
Article

Abstract

This note presents an elementary version of Sims's algorithm for computing strong generators of a given perm group, together with a proof of correctness and some notes about appropriate lowlevel data structures. Upper and lower bounds on the running time are also obtained. (Following a suggestion of Vaughan Pratt, we adopt the convention that perm=permutation, perhaps thereby saving millions of syllables in future research.)

AMS subject classifications (1991)

20-04 68 Q 25 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Akadémiai Kiadó 1991

Authors and Affiliations

  • Donald E. Knuth
    • 1
  1. 1.Computer Science DepartmentStanford UniversityStanfordUSA

Personalised recommendations