Explicit Constructions of Maximal 3-Zero-Sum-Free Subsets in $(\mathbb{Z}/4\mathbb{Z})^n$
Alfonso Davila Vera
Published: 2025/9/1
Abstract
We address Nathan Kaplan's 2014 CANT problem: the largest $H \subseteq (\mathbb{Z}/4\mathbb{Z})^n$ with no distinct $x, y, z \in H$ such that $x + y + z \equiv 0 \pmod{4}$. A universal optimal construction, $H = \{ v \mid v_1 \equiv 1 \text{ or } 3 \pmod{4} \}$, achieves size $4^n/2$ and density 0.5 for all $n$, proven maximal via $|H|^2 \leq (4^n - |H|) \cdot |H|$. Verified computationally to $n=10$; code at https://github.com/DynMEP/ZeroSumFreeSets-Z4/releases/tag/v5.0.0