Character theoretic techniques for nonabelian partial difference sets
Seth R. Nelson, Eric Swartz

TL;DR
This paper develops character theoretic methods for studying nonabelian partial difference sets, enabling nonexistence proofs and construction of new examples, thus advancing understanding of their structure and applications in graph theory.
Contribution
It extends character theoretic techniques from abelian to nonabelian groups, providing tools for analyzing, proving nonexistence, and constructing nonabelian PDSs.
Findings
Proved nonexistence of PDSs in numerous nonabelian groups.
Computed new examples of nonabelian PDSs, including infinite families.
Extended character theory results to the nonabelian setting.
Abstract
A -partial difference set (PDS) is a subset of size of a group of order such that every nonidentity element of can be expressed in either or different ways as a product , , depending on whether or not is in . If is inverse closed and , then the Cayley graph is a -strongly regular graph (SRG). PDSs have been studied extensively over the years, especially in abelian groups, where techniques from character theory have proven to be particularly effective. Recently, there has been considerable interest in studying PDSs in nonabelian groups, and the purpose of this paper is develop character theoretic techniques that apply in the nonabelian setting. We prove that analogues of character theoretic results of Ott about generalized quadrangles of order …
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
