Minimal generation of transitive permutation groups

2015/04/28 by Tracey, Gareth M.
#FOS: Mathematics #Group Theory (math.GR)

paper · doi:10.48550/arxiv.1504.07506

Abstract

It is proved in [21] that there is a constant c such that each transitive permutation group of degree d≥ 2 can be generated by \lfloor cd/√logd\rfloor elements. In this paper, we explicitly estimate c.

Related

• Sharp upper bounds on the minimal number of elements required to generate a transitive permutation group
• Generating minimally transitive permutation groups
• Invariable generation of permutation and linear groups
• Comparing the order and the minimal number of generators of a transitive permutation group
• On the base size and minimal degree of transitive groups