Efficient representation of perm groups
Donald E. Knuth
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 low-level 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.)
Create a lesson
Related papers
A Finite E-Group of Nilpotency Class Three
Xinan Dai, Wenhao Deng, Yidong Shi et al.
A Brown Theorem for Dehn functions of graphs of groups
Claudio Llosa Isenrich, Jannis Weis
Cross varieties of aperiodic monoids
Sergey V. Gusev
Groups with fast-growing conjugator length functions
Martin R. Bridson, Timothy R. Riley
On the complexity of the word problem of the R. Thompson group V
J. C. Birget
Nonsofic wreath products of residually finite groups
Gabor Kun, Andreas Thom