Minimal sized generating sets of permutation groups

2024/04/05 by Derek F. Holt, Holt, Derek F., Gareth Tracey +1
Computer Science · Engineering · Mathematics · #20-04 (Primary) 20B05 (Secondary) #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2404.03952

openalex publication_date 2024/04/05 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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.

Related

• Algorithms for the Minimum Generating Set Problem
• Towards a practical, theoretically sound algorithm for random generation in finite groups
• The Minimum Generating Set Problem
• Fast detection of giant permutation groups
• Generating minimally transitive permutation groups