A few more Hadamard Partitioned Difference Families
Abstract
A (G,[k1,…,kt],λ) partitioned difference family (PDF) is a partition B of an additive group G into sets ( blocks) of sizes k1, …, kt, such that the list of differences of B covers exactly λ times every non-zero element of G. It is called Hadamard (HPDF) if the order of G is 2λ. The study of HPDFs is motivated by the fact that each of them gives rise, recursively, to infinitely many other PDFs. Apart from the 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.