Comparing the order and the minimal number of generators of a transitive permutation group

2016/01/11 by Gareth Tracey, Gareth M. Tracey, Tracey, Gareth M.
Computer Science · Engineering · Mathematics · #20B35 #Coding theory and cryptography #FOS: Mathematics #Finite Group Theory Research #Group Theory (math.GR) #graph theory and CDMA systems #math.GR #msc:20B35

paper · pdf · doi:10.48550/arxiv.1601.02561

arxiv created 2016/01/11 · openalex publication_date 2016/01/11 · arxiv updated 2016/01/12 · openalex created_date 2016/08/23 · openalex updated_date 2026/07/28

Abstract

We prove that if G is a transitive permutation group, then d(G)log|G|/n² tends to 0 as n tends to ∞.

Related

• Sharp upper bounds on the minimal number of elements required to generate a transitive permutation group
• Generating minimally transitive permutation groups
• Minimal generation of transitive permutation groups
• On the base size and minimal degree of transitive groups
• Separating subsets from their images