Table of Contents
Fetching ...

Modular Golomb rulers and almost difference sets

Daniel M. Gordon

TL;DR

The paper analyzes existence questions for $(v,k,\lambda,t)$-almost difference sets and their connection to difference sets and modular Golomb rulers. It develops constructive tools for creating ADS by adding or removing a single element from a difference set, and classifies octic-residue ADS (types $O$ and $O_0$) while examining when such constructions yield valid ADS. It also studies modular Golomb rulers via relative difference sets (n=2), providing exhaustive MGR results up to $k=15$ and conjectural limits consistent with known Singer-type lifts. Complementing the theory, the author performs computational searches for general ADS with $v\le63$, corrects previous data, and maps the ADS existence landscape, including an explicit classification of residue-based ADS and open cases that guide future work.

Abstract

A $(v,k,λ)$-difference set in a group $G$ of order $v$ is a subset $\{d_1, d_2, \ldots,d_k\}$ of $G$ such that $D=\sum d_i$ in the group ring ${\mathbb Z}[G]$ satisfies $$D D^{-1} = n + λG,$$ where $n=k-λ$. In other words, the nonzero elements of $G$ all occur exactly $λ$ times as differences of elements in $D$. A $(v,k,λ,t)$-almost difference set has $t$ nonzero elements of $G$ occurring $λ$ times, and the other $v-1-t$ occurring $λ+1$ times. When $λ=0$, this is equivalent to a modular Golomb ruler. In this paper we investigate existence questions on these objects, and extend previous results constructing almost difference sets by adding or removing an element from a difference set. We also show for which primes the octic residues, with or without zero, form an almost difference set.

Modular Golomb rulers and almost difference sets

TL;DR

The paper analyzes existence questions for -almost difference sets and their connection to difference sets and modular Golomb rulers. It develops constructive tools for creating ADS by adding or removing a single element from a difference set, and classifies octic-residue ADS (types and ) while examining when such constructions yield valid ADS. It also studies modular Golomb rulers via relative difference sets (n=2), providing exhaustive MGR results up to and conjectural limits consistent with known Singer-type lifts. Complementing the theory, the author performs computational searches for general ADS with , corrects previous data, and maps the ADS existence landscape, including an explicit classification of residue-based ADS and open cases that guide future work.

Abstract

A -difference set in a group of order is a subset of such that in the group ring satisfies where . In other words, the nonzero elements of all occur exactly times as differences of elements in . A -almost difference set has nonzero elements of occurring times, and the other occurring times. When , this is equivalent to a modular Golomb ruler. In this paper we investigate existence questions on these objects, and extend previous results constructing almost difference sets by adding or removing an element from a difference set. We also show for which primes the octic residues, with or without zero, form an almost difference set.
Paper Structure (4 sections, 13 theorems, 22 equations, 1 figure, 4 tables)

This paper contains 4 sections, 13 theorems, 22 equations, 1 figure, 4 tables.

Key Result

Theorem 1

Let $D$ be an $(v,(v+3)/4,(v+3)/16)$-difference set of $G$, and let $d$ be an element of $D$. If $2d$ cannot be written as the sum of two distinct elements of $D$, then $D \backslash \{d\}$ is an $(v,(v-1)/4,(v-13)/16,(v-1)/2)$-almost difference set of $G$.

Figures (1)

  • Figure 1: $(v,k)$-ADS search results: dark squares exist, white squares (which have the value of $\hbox{$\hat{t}$}$ inset) do not, dashed squares took too long to complete the exhaust. Thick black lines divide regions with different $\lambda$ values.

Theorems & Definitions (16)

  • Theorem 1
  • Theorem 2
  • Theorem 3
  • Theorem 4
  • Theorem 5
  • Lemma 6
  • proof
  • Theorem 7
  • proof
  • Theorem 8
  • ...and 6 more