Minimal sized generating sets of permutation groups
Group Theory
2025-07-08 v3
Abstract
We present a randomised variant of an algorithm of Lucchini and Thakkar for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.
Cite
@article{arxiv.2404.03952,
title = {Minimal sized generating sets of permutation groups},
author = {Derek F. Holt and Gareth Tracey},
journal= {arXiv preprint arXiv:2404.03952},
year = {2025}
}