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.
Source: Journal of Algebra
Authors: Derek F. Holt, Gareth Tracey
Institution: University of Warwick
Language: English
Topic: Finite Group Theory Research
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,310
OpenAlex ID: W4413983198
