Local Fault Repair of Perfect Resource Placements in Eisenstein--Jacobi Networks

Abstract

Perfect resource placements in dense Eisenstein--Jacobi (EJ) networks partition the network into hexagonal radius-$t$ service cells. This paper studies local repair of such placements after resource failures. For one failed resource, we prove that one replacement cannot cover the failed hexagon and two always suffice, giving $ρ_{\mathrm{EJ}}(t)=2$ for all $t\ge1$. Among minimum-size repairs, the sharp minimum-overlap formula $Ω_{\mathrm{EJ}}(t)=t^2$ follows from the three-strip geometry of EJ balls. For two failed resources, independent repair gives a four-replacement upper bound, but unlike the Gaussian case EJ repair is not always additive: two infinite neighboring displacement families admit three-replacement repairs, proved optimal by a two-ball impossibility argument. Additive behavior is established algebraically via endpoint-rigidity and diagonal-corridor theorems. For $q$ failed resources, independent canonical repair gives a universal $2q$ upper bound, exact when failed cells are pairwise more than $4t$ apart. Dense cluster subadditivity is proved for infinite four-fault and six-fault families with exact repair numbers four and five, giving savings of four and seven over independent repair. An exact inclusion--exclusion identity governs repeated coverage for arbitrary multi-fault repairs. An audit over 19,400 instances confirms widespread subadditivity. EJ local repair is structurally distinct from the Gaussian case: the one-fault overlap is quadratic, two-fault repair can be non-additive, and clustered repairs reuse replacement balls across multiple failed cells.