Nonabelian partial difference sets constructed using abelian techniques
James Davis, John Polhill, Ken Smith, Eric Swartz

TL;DR
This paper extends the construction of partial difference sets from abelian to nonabelian groups, providing the first known examples in certain nonabelian groups and introducing Paley-type PDSs and Paley-Hadamard difference sets in nonabelian contexts.
Contribution
It demonstrates how abelian techniques can be adapted to construct nonabelian partial difference sets, including the first examples of Paley-type PDSs and Paley-Hadamard difference sets in nonabelian groups.
Findings
Constructed nonabelian PDSs of order q^{2m} for odd prime powers q
First known examples of Paley-type PDSs in nonabelian groups
First examples of Paley-Hadamard difference sets in nonabelian groups
Abstract
A -partial difference set (PDS) is a subset of a group such that , , and every nonidentity element of can be written in either or different ways as a product , depending on whether or not is in . Assuming the identity is not in and is inverse-closed, the corresponding Cayley graph will be strongly regular. Partial difference sets have been the subject of significant study, especially in abelian groups, but relatively little is known about PDSs in nonabelian groups. While many techniques useful for abelian groups fail to translate to a nonabelian setting, the purpose of this paper is to show that examples and constructions using abelian groups can be modified to generate several examples in nonabelian groups. In particular, in this paper we use such techniques to construct the…
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
