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
On supersoluble like groups of automorphisms of compact Riemann surfaces
Viachaslau I. Murashka
Steinberg module and top-dimensional cohomology for arithmetic Chevalley groups
Miguel Gentili
A Note on the OpenAI Construction of Counterexamples to the Kaplansky Direct-Finiteness Conjecture
Andrei Jaikin-Zapirain
Dense Exact Factorizations of Countable Topological Groups
Mikhail Kabenyuk
A positive answer to Barsotti and Carman's question on unit groups of Burnside rings of fusion systems
Chunbo Zhou, Heguo Liu
Extending a property of vector spaces to abelian groups
Alexandru-Nicolae Obreja, Marius Tărnăuceanu