Work

Minimal sized generating sets of permutation groups

Year: 2025
Type: article
Abstract: We present a randomised variant of an algorithm of Lucchini and Thakkar [10] for finding a smallest sized generating set in a finite group, which has polynomial time expected running time in finite permutation groups.
Language: English
Open Access status: hybrid
Estimated APC paid: $3,310
OpenAlex ID: W4413983198
FWCI:
Cites: 12
Cited by:
Related to: 10