Automorphism groups of designs with $\lambda=1$
William M. Kantor

TL;DR
This paper demonstrates that for certain parameters, any finite group can be realized as the automorphism group of an infinite family of 2-designs with specific parameters, expanding understanding of symmetry groups in combinatorial designs.
Contribution
It constructs infinite families of 2-(v,k,1) designs with prescribed automorphism groups for particular parameters, showing the universality of automorphism groups in these designs.
Findings
Any finite group can be realized as an automorphism group for infinitely many 2-(v,k,1) designs with specified parameters.
The construction applies when k=q>2 or k=q+1 for a prime power q.
The result broadens the class of known automorphism groups for combinatorial designs.
Abstract
If is a finite group and or for a prime power then, for infinitely many integers , there is a --design for which .
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 · Finite Group Theory Research · Coding theory and cryptography
