Almost Difference Sets in Nonabelian Groups
Jerod Michel, Qi Wang

TL;DR
This paper introduces two new methods for constructing almost difference sets in nonabelian groups, resulting in infinite families with applications to Ramanujan graphs.
Contribution
It presents novel generic and specific constructions of almost difference sets in nonabelian groups, expanding the known classes and their applications.
Findings
Constructed infinite families of almost difference sets in nonabelian groups.
Some resulting Cayley graphs are Ramanujan graphs.
New constructions applicable to groups with additive subgroups of finite fields.
Abstract
We give two new constructions of almost difference sets. The first is a generic construction of almost difference sets in certain groups of order ( is an odd prime power) having ( as a subgroup. The construction occurs in any group of order ( is an odd prime) having ( as an additive subgroup. This construction yields several infinite families of almost difference sets, many of which occur in nonabelian groups. The second construction yields almost difference sets in dihedral groups of order where is a prime. Moreover, it turns out that some of the infinite families of almost difference sets obtained have Cayley graphs which are Ramanujan graphs. \keywords{Difference set \and Almost difference set \and Nonabelian…
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
