Efficient representation of perm groups
Group Theory
2008-02-03 v1
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.)
Cite
@article{arxiv.math/9201304,
title = {Efficient representation of perm groups},
author = {Donald E. Knuth},
journal= {arXiv preprint arXiv:math/9201304},
year = {2008}
}