Explicit Constructions of Maximal 3-Zero-Sum-Free Subsets in $(\mathbb{Z}\mathrm{/}4\mathbb{Z}{)}^n$

We address a problem posed by Nathan Kaplan in the 2014 Combinatorial and Additive Number Theory session: finding the largest subset $H\subseteq (\mathbb{Z}\mathrm{/}4\mathbb{Z}{)}^n$ with no distinct $x,y,z\in H$ such that $x+y+z\equiv 0(\mathrm{m}\mathrm{o}\mathrm{d}4)$. For even-order abelian groups, a standard $\mathrm{\mid }G\mathrm{\mid }\mathrm{/}2$ lower bound applies. We prove this is optimal for $G=(\mathbb{Z}\mathrm{/}4\mathbb{Z}{)}^n$ using a pair-counting argument, with an explicit construction of vectors with first coordinate odd (1 or 3 mod 4), yielding size $2\times 4^{n-1}=4^n\mathrm{/}2$ and density 0.5, verified for $n\le 10$. An AI-assisted hybrid greedy-genetic algorithm rediscovers this optimal size, highlighting its potential in combinatorial search.