A few more Hadamard Partitioned Difference Families
Anamari Nakic

TL;DR
This paper introduces three new examples of Hadamard partitioned difference families and explores their existence, expanding the limited known instances and initiating a broader investigation into their parameters.
Contribution
The paper presents three new Hadamard partitioned difference families and begins a systematic study of their existence conditions.
Findings
Three new HPDF examples in various groups.
Initial results on the existence of HPDFs with specific parameters.
Foundational steps for future classification of HPDFs.
Abstract
A {\it partitioned difference family} (PDF) is a partition of an additive group into sets ({\it blocks}) of sizes , \dots, , such that the list of differences of covers exactly times every non-zero element of . It is called {\it Hadamard} (HPDF) if the order of is . The study of HPDFs is motivated by the fact that each of them gives rise, recursively, to infinitely many other PDFs. Apart from the {\it elementary} HPDFs consisting of a Hadamard difference set and its complement, only one HPDF was known. In this article we present three new examples in several groups and we start a general investigation on the possible existence of HPDFs with assigned parameters by means of simple arguments.
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
