English

A few more Hadamard Partitioned Difference Families

Combinatorics 2023-07-20 v1

Abstract

A (G,[k1,,kt],λ)(G,[k_1,\dots,k_t],\lambda) {\it partitioned difference family} (PDF) is a partition B\cal B of an additive group GG into sets ({\it blocks}) of sizes k1k_1, \dots, ktk_t, such that the list of differences of B{\cal B} covers exactly λ\lambda times every non-zero element of GG. It is called {\it Hadamard} (HPDF) if the order of GG is 2λ2\lambda. 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.

Cite

@article{arxiv.2307.09852,
  title  = {A few more Hadamard Partitioned Difference Families},
  author = {Anamari Nakic},
  journal= {arXiv preprint arXiv:2307.09852},
  year   = {2023}
}
R2 v1 2026-06-28T11:34:27.291Z