English

Nonabelian partial difference sets constructed using abelian techniques

Combinatorics 2023-07-31 v1 Group Theory

Abstract

A (v,k,λ,μ)(v,k,\lambda, \mu)-partial difference set (PDS) is a subset DD of a group GG such that G=v|G| = v, D=k|D| = k, and every nonidentity element xx of GG can be written in either λ\lambda or μ\mu different ways as a product gh1gh^{-1}, depending on whether or not xx is in DD. Assuming the identity is not in DD and DD is inverse-closed, the corresponding Cayley graph Cay(G,D){\rm Cay}(G,D) 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 first known examples of PDSs in nonabelian groups of order q2mq^{2m}, where qq is a power of an odd prime pp and m2m \ge 2. The groups constructed can have exponent as small as pp or as large as prp^r in a group of order p2rp^{2r}. Furthermore, we construct what we believe are the first known Paley-type PDSs in nonabelian groups and what we believe are the first examples of Paley-Hadamard difference sets in nonabelian groups, and, using analogues of product theorems for abelian groups, we obtain several examples of each. We conclude the paper with several possible future research directions.

Keywords

Cite

@article{arxiv.2307.15648,
  title  = {Nonabelian partial difference sets constructed using abelian techniques},
  author = {James Davis and John Polhill and Ken Smith and Eric Swartz},
  journal= {arXiv preprint arXiv:2307.15648},
  year   = {2023}
}

Comments

26 pages

R2 v1 2026-06-28T11:43:00.273Z