A few more Hadamard Partitioned Difference Families
arXiv:2307.09852
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.