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
Bisoluble and Binilpotent Skew Braces of Finite Morley Rank
Maria Ferrara, Moreno Invitti, Marco Trombetti et al.
Bergman's amalgamation problem over the circle
Andreas Thom
Some Infinite Families of Arithmetic Symplectic Hypergeometric Groups
Lal Bahadur Sahu
Inherently nonfinitely based additively idempotent semirings
Miao Miao Ren, Meng Ya Yue, Yi Lin Zhou
Cosets with constant characteristic polynomial
Nir Avni, Tsachik Gelander
Finite quotients of spherical Artin groups
Sam Hughes, Thomas Ng, Kaitlin Ragosta et al.