Bounds for the diameters of orbital graphs of affine groups
Attila Mar\'oti, Saveliy V. Skresanov

TL;DR
This paper establishes bounds on the diameters of orbital graphs in finite affine primitive groups, providing explicit bounds based on the group's parameters without relying on the classification of finite simple groups.
Contribution
It introduces general bounds for orbital diameters in affine primitive groups and constructs families with large diameters, independent of finite simple group classification.
Findings
Orbital diameter bounded by dimension and subgroup size ratios
Construction of infinite families with large orbital diameters
Bounds applicable without classification of finite simple groups
Abstract
General bounds are presented for the diameters of orbital graphs of finite affine primitive permutation groups. For example, it is proved that the orbital diameter of a finite affine primitive permutation group with a nontrivial point stabilizer , where the vector space has dimension over the prime field, can be bounded in terms of and only. Several infinite families of affine primitive permutation groups with large orbital diameter are constructed. The results are independent from the classification of finite simple groups.
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 · Coding theory and cryptography · Genomic variations and chromosomal abnormalities
