Perfect difference families, perfect systems of difference sets and their applications

TL;DR

The paper resolves the existence of $(v,4,\lambda)$- PDFs by proving a complete characterization: a $(v,4,\lambda)$-PDF exists iff $\lambda(v-1) \equiv 0 \pmod{12}$ with $v\ge 13$, excluding $(25,1)$ and $(37,1)$. It introduces layered difference families (LDF) as a unifying framework that translates differences and interval structure into a group-ring formulation, enabling concise constructions and simplifications of many cyclic difference packings. The authors develop a direct construction for $(v,3,1)$-PDFs, establish the existence of $(m,4,3)$-PSDSs for all $m\ge 5$, and extend the PDF existence to all $\lambda$ via combinations of base PDFs (λ=1,2,3,6, and general λ). These results yield broad applications across additive permutation sequences, perfect difference matrices, difference triangle sets, optical and geometric orthogonal codes, and graceful graph labelings, demonstrating the practical impact of a unified DF/PSDS framework in combinatorial design and coding theory.

Abstract

Let $v$ be a positive odd integer. A $(v,k,λ)$-perfect difference family (PDF) is a collection $\mathcal{F}$ of $k$-subsets of $\{0,1,\ldots,v-1\}$ such that the multiset $\bigcup_{F\in \mathcal{F}}\{x-y : x,y\in F, x>y\}$ covers each element of $\left\{1,2,\ldots,(v-1)/2\right\}$ exactly $λ$ times. Perfect difference families are a special class of perfect systems of difference sets. They were introduced by Bermond, Kotzig, and Turgeon in the 1970s, following a problem suggested by Erdős. In this paper, we prove that a $(v,4,λ)$-PDF exists if and only if $λ(v-1) \equiv 0 \pmod{12}$, $v \geq 13$, and $(v,λ) \notin \{(25,1),(37,1)\}$. This result resolves a nearly 50-year-old conjecture posed by Bermond. Perfect difference families find applications in radio astronomy, optical orthogonal codes for optical code-division multiple access systems, geometric orthogonal codes for DNA origami, difference triangle sets, additive sequences of permutations, and graceful graph labelings. To establish our main result, we introduce a new concept termed a layered difference family. This concept provides a powerful and unified perspective that not only facilitates our proof of the main theorem but also simplifies recent existence proofs for various cyclic difference packings.

Theorems & Definitions (75)

• Definition 1.1
• Definition 1.2
• Proposition 1.1
• Theorem 1.1
• Conjecture 1.1: Bermond, 1978
• Lemma 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Definition 1.3