Automorphism subgroups for designs with $\lambda=1$
William M. Kantor

TL;DR
This paper investigates the automorphism groups of certain combinatorial designs, proving that for large enough parameters, these designs can have automorphism groups containing specified subgroups, depending on the group's order.
Contribution
It establishes the existence of 2-(v,k,1) designs with automorphism groups containing a given subgroup, extending previous results to larger classes of groups.
Findings
Existence of designs with automorphism groups containing a specified subgroup for large v.
Automorphism groups can include subgroups isomorphic to any odd order group under certain conditions.
Weaker results are obtained for even order groups with additional restrictions.
Abstract
Given an integer and a group of odd order, if there exists a --design and if is sufficiently large, then there is such a design whose automorphism group has a subgroup isomorphic to . A weaker result is proved when is even and .
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
