Minimal generating sets of permutation groups

3:30PM, 11 Dec 2025

Colva Roney-Dougal presents new bounds on minimal generating sets in permutation groups and shows what they reveal about product replacement.

The product replacement algorithm generates random elements of a finite group, yet performs far better than theory predicts. A key parameter is the largest size of a minimal generating set. In this talk, building on Julius Whiston’s result that the symmetric group on n points has size n–1, Prof. Colva Roney-Dougal presents new tight bounds for all its subgroups and explores their wider impact on product replacement.

Colva Roney-Dougal is a professor of pure mathematics at St Andrews. She holds a PhD from Queen Mary University of London and is also known for her work on popularising mathematics, particularly on the radio. Her research focuses on group theory and computational algebra.

Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups
Minimal generating sets of permutation groups