The minimal size of a generating set for primitive $\frac{3}{2}$-transitive groups
Dmitry Churikov, Andrey V. Vasil'ev, Maria A. Zvezdina

TL;DR
This paper establishes that all primitive 3/2-transitive groups are generated by at most four elements, with most being generated by two, and provides a complete description of exceptions, contributing to the understanding of minimal generating sets.
Contribution
It proves that primitive 3/2-transitive groups have a minimal generating set of size at most four, and most are two-generated, offering a complete classification of certain solvable affine groups.
Findings
All primitive 3/2-transitive groups are at most 4-generated.
Most such groups are 2-generated, except specific solvable affine groups.
Groups with cyclic abelian subgroups and Frobenius complements are 2-generated.
Abstract
We refer to as the minimal cardinality of a generating set of a finite group , and say that is -generated if . A transitive permutation group is called -transitive if a point stabilizer is nontrivial and its orbits distinct from are of the same size. We prove that for every primitive -transitive permutation group , moreover, is -generated except for the very particular solvable affine groups that we completely describe. In particular, all finite -transitive and -homogeneous groups are -generated. We also show that every finite group whose abelian subgroups are cyclic is -generated, and so is every Frobenius complement.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · graph theory and CDMA systems · Coding theory and cryptography
