Reduction for flag-transitive symmetric designs with $k>\lambda(\lambda-2)$
Jianfu Chen, Jiaxin Shen, Shenglin Zhou

TL;DR
This paper classifies flag-transitive automorphism groups of symmetric designs with specific parameter constraints, showing they are either affine or almost simple types when the group is point-primitive.
Contribution
It extends previous results by analyzing the case where the automorphism group is point-primitive, using the O'Nan-Scott Theorem to classify the group types.
Findings
G must be of affine or almost simple type when point-primitive
Confirmed the structure of automorphism groups under given parameter conditions
Extended classification results for symmetric designs with flag-transitive automorphisms
Abstract
Let be a flag-transitive automorphism group of a symmetric design with . O'Reilly Regueiro proved that if is point-imprimitive, then has parameters . In the present paper, we consider the case that is point-primitive. By applying the O'Nan-Scott Theorem, we prove that must be of affine type or almost simple type.
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
Topicsgraph theory and CDMA systems · Coding theory and cryptography · Finite Group Theory Research
