“…For every odd n, choose R n and H n = R n ⊔ S n such that x, y, z, z ′ ∈ H n with x ∈ R n , (x, y) = (z, z ′ ) =⇒ |x − z − y + z ′ | ≫ 2h n ≥ 2 max D(I 0 , n). This is a stronger version of condition (2-1) in [7], and similar to the restriction discussed in Remark 1, [4]. Add max{H n } + h n spacers on the rightmost subcolumn for every n, and choose δ n such that n odd δ k n → ∞ but n odd δ k+1 n < ∞.…”