# Shifted-Window Delay-Buffer Automata, Transpose-Reflection Duality, and Branch-Coupled Curve Translate Families Below $1.8n$

## Abstract

For primes $p$, a bivariate polynomial translate family $H_p(f, g; S_k(\delta)) = \{(x, y) \in \mathbb{F}_p^2 : g(y) - f(x) \equiv s \pmod p,\; s \in S_k(\delta)\}$ across a shifted contiguous window $S_k(\delta) = \{\delta, \dots, \delta+k-1\}$ ($\delta \in \mathbb{Z}$) admits a **carrier-restricted coordinate-line cover upper bound** $|S| \le 2\,\tau(\Gamma_p(f, g; S_k(\delta)))$ on any collinearity-free subset $S \subseteq H_p(f, g; S_k(\delta))$, where $\tau(\Gamma_p)$ is the minimum weighted vertex cover of the cyclic value-incidence bipartite graph on $\mathbb{Z}/p\mathbb{Z} \sqcup \mathbb{Z}/p\mathbb{Z}$. Prior coordinate-cover automata [1, 2] required the unshifted window $S_k(0)$ or decoupled antipodal shifts, leaving open the finite-lag regime $\delta \in \mathbb{Z}$ where shared branch loci induce causal memory of length $|\delta|$ and collapse self-paired curves $f = g$ at $\delta = 0$ to $2\gamma^*(S_k(0); \mathcal{J}_{f,f}) = 2$.

We resolve the finite-lag regime by introducing the **Causal Shifted-Window Delay-Buffer Automaton**, which couples the canonical operator $F_{\mathrm{canon}}$ along the decreasing cyclic scan $u \equiv -t \pmod p$ to a $|\delta|$-slot FIFO memory register on $\mathcal{S}_k(\delta; \mathcal{J}_{f,g}) \subseteq \mathcal{S}_{\mathrm{canon}}(S_k(0)) \times \Sigma^{|\delta|}$. Defining the strict $1.80$ window horizon $k_{\max}(\delta; \mathcal{J}_{f,g}) := \max(\{0\} \cup \{k \ge 1 : 2\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) < 9/5\})$ and the zero-avoidance distance $d_0(\delta) := \max(0, \delta, -(k-1)-\delta)$, we prove:
1. **Delay-Buffer Automaton, Transpose/Time-Reversal Dualities, and Antipodal Branch Resonance (Theorem 1 & Proposition 1):** Under multi-site Galois linear disjointness, an explicit block-cutting boundary estimate shows that $\lim_{p\to\infty} \frac{2}{p}\tau(\Gamma_p(f, g; S_k(\delta))) = 2\gamma^*(S_k(\delta); \mathcal{J}_{f,g})$ is governed by the finite-state chain on $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$. Plain coordinate transposition $\mathcal{T}(u, v) = (v, u)$ gives the exact finite-prime identity $\tau(\Gamma_p(f, g; S_k(\delta))) = \tau(\Gamma_p(g, f; S_k(-(k-1)-\delta)))$, while cyclic time reversal $\mathcal{R}(u, v) = (-u \bmod p, -v \bmod p)$ yields the asymptotic reflection symmetry $\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) = \gamma^*(S_k(-(k-1)-\delta); \mathcal{J}_{f,g})$ for *every* single-site law $\mathcal{J}_{f,g}$. For the antipodal shift $\delta_p = (p-1)/2 \equiv -1/2 \pmod p$, we formulate the **Two-Block Antipodal Galois Linear Disjointness Hypothesis**, prove it for Kummer and Morse $S_3$ families [9, 10], and construct an explicit composite dihedral quartic counterexample $f(x) = (x^2+x+1)^2$, $g(y) = (y^2+y)^2$ where $\mathcal{B}_f - \mathcal{B}_g \ni \frac{1}{2}$ locks both quadratic subfields onto $\mathbb{F}_p(\sqrt{9-16t})$ at $\delta_p = (p-1)/2$ for every odd prime $p$, raising $2\gamma^*(S_1((p-1)/2))$ from $\frac{5}{8} = 0.625$ to $\frac{3}{4} = 0.750$.
2. **Closed-Form Finite-Lag Regimes for Self-Paired Superelliptic Curves $y^m - x^m \in S_k(\delta)$ (Theorem 2):** We obtain closed-form drifts for: (i) zero-containing collapse $2\gamma^* = 2$ with $|\mathcal{S}_k(\delta)| = 2^{-\delta}$ at $d_0(\delta) = 0$; (ii) unit-lag compression $|\mathcal{S}_k(1)| = k+1$ (versus $|\mathcal{S}_k(-k)| = 3 \cdot 2^{k-1} - 1$) and $2\gamma^* = 2(1 - ((m-1)/m)^k)$ at $d_0(\delta) = 1$, restoring non-trivial horizons $k_{\max}(1; \mathcal{J}_{C_m, C_m}) \in \{3, 5, 8\}$ for $m \in \{2, 3, 4\}$; (iii) geometric lag decay $2\gamma^*(S_2(\delta); \mathcal{J}_{C_m, C_m}) = \frac{4}{m+1} + \frac{2(m-1)}{m+1} m^{-2 d_0(\delta)}$ for all $\delta \in \mathbb{Z}$; and (iv) an exact prefix-product stationary law on the $2^{k-1}$ states of $C_m \otimes C_m$ giving $2\gamma^*(S_k; C_m \otimes C_m) = \frac{2k}{k+m-1}$ and $k_{\max}(\infty; C_m \otimes C_m) = 9m - 10$.
3. **Finite-Lag Transitions for Nested Kummer Curves $y^{dm} - x^m \in S_k(\delta)$ (Theorem 3):** Beyond the unshifted and antipodal $(C_2, C_4)$ baselines of [2, Theorem 2(iv)-(v)], we prove: (i) unit-lag state doubling $|\mathcal{S}_k(1; \mathcal{J}_{2,4})| = 2(2^k - 1)$; (ii-a) **sub-critical 1-step decoupling** for $1 \le k \le d$ from $2\bigl(1 - \frac{d-1}{d}(\frac{dm-1}{dm})^{k-1}\bigr)$ at $d_0(\delta) = 0$ to $2\bigl(1 - (\frac{dm-1}{dm})^k\bigr)$ for all $d_0(\delta) \ge 1$; (ii-b) an exact 4-class **period-2 geometric staircase** at $k = d + 1 = 3$ for $\mathcal{J}_{2,4}$ decaying to $\frac{68}{61}$ at rate $\frac{3}{64}$ per two lag steps; (iii) **interior zero-lag splitting** on $-(k-1) \le \delta \le 0$ for $k = 4, 5$; and (iv) unit-lag horizon expansion from $k_{\max}(0; \mathcal{J}_{2,4}) = 11$ [2] to $k_{\max}(1; \mathcal{J}_{2,4}) = 12$.
4. **Non-Abelian Self-Paired $S_3$ Shifted Windows (Theorem 4):** For $f(x) = g(y) = x^3 - 3x$, where $|\mathcal{S}_k(\infty; S_3 \otimes S_3)| = \frac{3^k - 1}{2}$ with $k_{\max}(\infty; S_3 \otimes S_3) = 9$, unit lag $\delta = 1$ compresses the state space to the cubic polynomial $|\mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})| = \binom{k+2}{3} + k + 1$ with $k_{\max}(1; \mathcal{J}_{S_3, S_3}) = 4$ ($2\gamma^* = \frac{427913}{238788} \approx 1.792021 < 1.80$).

All theoretical predictions are confirmed by exact cyclic Bellman dynamic programming across primes $p \equiv 1 \pmod{12}$ near $p \approx 2000$. These results establish carrier-restricted coordinate-line cover upper bounds for shifted bivariate curve translate families; the unrestricted No-Three-In-Line problem on $\{0, \dots, n-1\}^2$ remains open.

---

## 1. Introduction and Problem Formulation

### 1.1 Shifted-Window Bivariate Curve Translates and Coordinate-Line Cover Upper Bounds

The classical No-Three-In-Line problem [3, 4, 5, 6, 7, 8, 11] asks for the maximum size of a subset $S \subseteq \{0, \dots, n-1\}^2$ containing no three collinear points; while the greedy ceiling is $2n$ and Erdős's modular parabola construction achieves $(1 - o(1))n$ [5], the best known asymptotic constructions achieve $(\frac{3}{2} - o(1))n$ [6, 7] and the target benchmark highlighted in recent challenges is $\frac{9}{5}n = 1.8n$ [4, 8, 11]. A recurring structural program for testing whether algebraic curve families can approach or exceed $1.8p$ in $\mathbb{F}_p^2$ is the **carrier-restricted coordinate-line cover obstruction** [1, Section 1; 2, Section 1]: for any carrier set $H \subseteq \mathbb{F}_p^2$ and any line cover of $H$ consisting of $a$ vertical lines $x = x_0$ and $b$ horizontal lines $y = y_0$, the pigeonhole principle forces every collinearity-free subset $S \subseteq H$ to contain at most $2$ points on each of the $a + b$ covering lines, yielding the deterministic upper bound $|S| \le 2(a + b)$ (ignoring collinearities along non-coordinate lines, which can only reduce $|S|$ further).

Let $p$ be an odd prime, let $f, g \in \mathbb{Z}[T]$ be non-constant monic polynomials of degrees $d_f, d_g \ge 2$, and for any integer width $k \ge 1$ and integer shift (or lag) $\delta \in \mathbb{Z}$ consider the shifted contiguous window
$$S_k(\delta) \;:=\; \{\delta, \delta + 1, \dots, \delta + k - 1\} \;\subset\; \mathbb{Z}.$$
The associated bivariate curve translate family in $\mathbb{F}_p^2$ is the union of $k$ affine curve translates
$$H_p\bigl(f, g; S_k(\delta)\bigr) \;:=\; \bigl\{(x, y) \in \mathbb{F}_p^2 : g(y) - f(x) \equiv s \pmod p \text{ for some } s \in S_k(\delta)\bigr\}.$$
Grouping coordinates by their polynomial values $u = f(x) \in \mathbb{F}_p$ and $v = g(y) \in \mathbb{F}_p$ defines the cyclic value-incidence bipartite graph $\Gamma_p(f, g; S_k(\delta))$ with vertex parts $U = \mathbb{Z}/p\mathbb{Z}$ (carrying vertical fiber weights $R_f(u) := |\{x \in \mathbb{F}_p : f(x) = u\}|$) and $V = \mathbb{Z}/p\mathbb{Z}$ (carrying horizontal fiber weights $R_g(v) := |\{y \in \mathbb{F}_p : g(y) = v\}|$) and edges
$$E_p\bigl(f, g; S_k(\delta)\bigr) \;:=\; \bigl\{(u, v) \in (\mathbb{Z}/p\mathbb{Z})^2 : v - u \equiv s \pmod p \text{ for some } s \in S_k(\delta)\bigr\}.$$
Every vertex cover $(A, B) \subseteq U \times V$ of $\Gamma_p(f, g; S_k(\delta))$ corresponds to covering $H_p(f, g; S_k(\delta))$ by the $\sum_{u \in A} R_f(u)$ vertical lines $\{x \in \mathbb{F}_p : f(x) \in A\}$ and the $\sum_{v \in B} R_g(v)$ horizontal lines $\{y \in \mathbb{F}_p : g(y) \in B\}$. Optimizing over $(A, B)$ yields the **carrier-restricted coordinate-line cover upper bound**
$$|S| \;\le\; 2\,\tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr) \qquad \bigl(\forall \text{ collinearity-free } S \subseteq H_p(f, g; S_k(\delta))\bigr),$$
where $\tau(\Gamma_p(f, g; S_k(\delta)))$ is the minimum weight of a vertex cover of $\Gamma_p(f, g; S_k(\delta))$:
$$\tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr) \;:=\; \min_{\substack{A, B \subseteq \mathbb{Z}/p\mathbb{Z} \\ \forall u \in \mathbb{Z}/p\mathbb{Z},\, \forall s \in S_k(\delta):\, u \in A \text{ or } u+s \in B}} \left(\sum_{u \in A} R_f(u) \;+\; \sum_{v \in B} R_g(v)\right).$$
Comparing this upper bound against the $1.8p$ benchmark [4, 8, 11] defines the **strict $1.80$ window horizon** $k_{\max}(\delta; \mathcal{J}_{f,g})$, namely the largest window width $k \ge 1$ (or $0$ if none exists) for which the asymptotic coordinate-cover density remains strictly below $\frac{9}{5} = 1.80$:
$$2\gamma^*\bigl(S_k(\delta); \mathcal{J}_{f,g}\bigr) \;:=\; \lim_{p \to \infty} \frac{2\,\tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr)}{p} \;<\; \frac{9}{5} \;=\; 1.80, \qquad k_{\max}(\delta; \mathcal{J}_{f,g}) \;:=\; \max\Bigl(\{0\} \cup \bigl\{k \ge 1 : 2\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) < 1.80\bigr\}\Bigr).$$

### 1.2 The Diagonal Bottleneck at $\delta = 0$ and the Lagged Coupling Question

In [1, Theorem 3] and [2, Theorem 2], we introduced the bivariate required-row automaton $\mathcal{A}_k(\Sigma_f, \Sigma_g)$ for the unshifted contiguous window $S_k(0) = \{0, 1, \dots, k-1\}$ and analyzed the branch-shared versus antipodally shifted Kummer pair $y^4 - x^2 \equiv c_0 + s \pmod p$ ($c_0 = 0$ with $k_{\max} = 11$ in [2, Theorem 2(v)] versus $c_0 \equiv (p-1)/2 \pmod p$ with $k_{\max} = 18$ in [2, Theorem 2(iv)]). However, restricting the automaton to $\delta = 0$ or the decoupled antipodal limit $\delta \equiv (p-1)/2 \pmod p$ left open a fundamental structural question for finite integer shifts $\delta \in \mathbb{Z}$:
- **Zero-lag diagonal collapse for self-paired curves:** Whenever $f = g$, the fiber multiplicities coincide identically ($R_f(u) = R_g(u)$ for every $u \in \mathbb{F}_p$). If $0 \in S_k(\delta)$ (that is, $-(k-1) \le \delta \le 0$), the edge $(u, u)$ is present in $\Gamma_p(f, f; S_k(\delta))$ for every $u$, forcing $u \in A$ or $u \in B$ at every site $u$ and collapsing the coordinate-cover bound to the trivial ceiling $2\gamma^*(S_k(\delta); \mathcal{J}_{f,f}) = 2\mathbb{E}[\min(R_f(u), R_f(u))] = 2$ identically.
- **Finite-lag memory across shared branch loci:** Even when $f \ne g$ (such as the nested Kummer family $f(x) = x^m$, $g(y) = y^{dm}$ sharing the single finite branch value $u = 0$), shifting $S_k(0)$ to $S_k(\delta) = \{\delta, \dots, \delta+k-1\}$ couples $R_f(u)$ not to $R_g(u)$, but to the shifted window of horizontal multiplicities $R_g(u+\delta), \dots, R_g(u+\delta+k-1)$. Because $(R_f(u), R_g(u))$ is correlated at each site $u$ via $\mathcal{J}_{f,g}$ while distinct sites $u \ne u'$ are asymptotically independent under multi-site Galois linear disjointness [1, Theorem 3; 2, Theorem 2(iv)], a finite shift $\delta \ne 0$ introduces a **finite-horizon causal memory** of length $|\delta|$ between the vertical and horizontal coordinates.

In this paper, we construct the exact finite-state Markov operator governing $H_p(f, g; S_k(\delta))$ for every integer shift $\delta \in \mathbb{Z}$ and characterize when the antipodal shift $\delta \equiv (p-1)/2 \pmod p$ decouples versus when rational branch-locus differences of $\frac{1}{2}$ trigger persistent antipodal Galois resonance.

---

## 2. The Causal Shifted-Window Delay-Buffer Automaton and Transpose-Reflection Duality

### 2.1 Canonical Lag Re-Indexing and the Delay-Buffer State Space

Let $S_k(\delta) = \{\delta, \delta+1, \dots, \delta+k-1\}$ with $k \ge 1$ and $\delta \in \mathbb{Z}$. Observe that in the bipartite incidence graph $\Gamma_p(f, g; S_k(\delta))$, a vertical vertex $u \in \mathbb{Z}/p\mathbb{Z}$ is adjacent to the horizontal vertices
$$v \;\equiv\; u + \delta + j \pmod p, \qquad j \in \{0, 1, \dots, k-1\}.$$
If we define the lag-reindexed horizontal multiplicity sequence
$$Y_u^{(\delta)} \;:=\; R_g(u + \delta \bmod p) \qquad (u \in \mathbb{Z}/p\mathbb{Z}),$$
then the bipartite graph $\Gamma_p(f, g; S_k(\delta))$ with weight sequences $(R_f(u), R_g(v))$ is **isomorphic as a weighted graph** to the canonical unshifted window graph $\Gamma_p(S_k(0))$ with weight sequences $(X_u, Y_u^{(\delta)}) := (R_f(u), R_g(u+\delta))$.

Recall from [1, Theorem 3; 2, Theorem 2(i)] that for the canonical contiguous window $S_k(0) = \{0, 1, \dots, k-1\}$ of span $D = k - 1$, the causal dynamic program scans the vertical coordinates $u \in \mathbb{Z}/p\mathbb{Z}$ in **decreasing cyclic order** $u \equiv -t \pmod p$ ($t = 1, 2, \dots, p$). At scan step $t$ (site $u = -t$), the $k - 1$ non-zero horizontal neighbors $u + 1, \dots, u + k - 1$ of $u$ have already been visited as the base horizontal vertices of the previous $k - 1$ steps $u + j = -(t - j)$ ($1 \le j \le k - 1$). Consequently, only the $k$ monotone prefix bitmasks
$$m_j \;:=\; 2^j - 1 \;\in\; \{0, 1, \dots, 2^{k-1}-1\} \qquad (j = 0, 1, \dots, k-1)$$
are reachable: $m_j$ indicates that the $j$ most recently scanned horizontal coordinates $\{u+1, \dots, u+j\}$ have already been covered by $B$, while if $j < k-1$ the uncovered horizontal offset $u + j + 1$ forces the current vertical vertex $u$ into $A$ whenever $X_u > 0$. Writing a normalized cost vector on $\{m_0, \dots, m_{k-1}\}$ as $v = (v_0, v_1, \dots, v_{k-1}) \in \mathbb{Z}_{\ge 0}^k$ with $v_0 = 0$, the single-step canonical Bellman operator $F_{\mathrm{canon}} : \mathbb{Z}_{\ge 0}^k \times \Sigma_f \times \Sigma_g \to \mathbb{Z}_{\ge 0}^k \times \mathbb{Z}_{\ge 0}$ mapping $(v, x, y) \mapsto (v', b_0)$ is given explicitly for $i \in \{0, 1, \dots, k-1\}$ by
$$\widetilde{v}_i \;=\; \begin{cases} v_{\max(0, i-1)} + y \cdot \mathbf{1}_{\{i \ge 1\}} & \text{if } x = 0, \\[4pt] \min\!\bigl(v_{\max(0, i-1)} + x + y \cdot \mathbf{1}_{\{i \ge 1\}},\; v_{k-1} + y\bigr) & \text{if } x > 0, \end{cases}$$
followed by normalization $b_0 := \widetilde{v}_0$ and $v'_i := \widetilde{v}_i - b_0$.

Under the decreasing cyclic scan $u \equiv -t \pmod p$, let $(\widetilde{X}_s, \widetilde{Y}_s) := (R_f(-s \bmod p),\, R_g(-s \bmod p))$ denote the single-site multiplicity pair at scan index $s$. Then at scan step $t$ ($u = -t$), the lag-reindexed input pair required by $F_{\mathrm{canon}}$ for the shifted window $S_k(\delta)$ is
$$\bigl(X_{-t},\, Y_{-t}^{(\delta)}\bigr) \;=\; \bigl(R_f(-t),\; R_g(-t + \delta)\bigr) \;=\; \bigl(\widetilde{X}_t,\; \widetilde{Y}_{t - \delta}\bigr).$$
When $\delta = 0$, the input pair $(\widetilde{X}_t, \widetilde{Y}_t)$ is drawn i.i.d. from $\mathcal{J}_{f,g}$ in the $p \to \infty$ limit. When $\delta \ne 0$, the random pairs $(\widetilde{X}_s, \widetilde{Y}_s)_{s \in \mathbb{Z}}$ are i.i.d. with law $\mathcal{J}_{f,g}$ across distinct scan indices $s$, so $(\widetilde{X}_t, \widetilde{Y}_{t-\delta})$ is a $|\delta|$-dependent stationary sequence in which $\widetilde{Y}_{t-\delta}$ (for $\delta > 0$) or $\widetilde{X}_t = \widetilde{X}_{(t+|\delta|)-|\delta|}$ (for $\delta < 0$) was generated $|\delta|$ steps earlier in the scan. We convert this $|\delta|$-dependent sequence into an exact first-order Markov chain by appending a $|\delta|$-slot FIFO delay buffer.

**Theorem 1 (Causal Shifted-Window Delay-Buffer Automaton, Transpose/Time-Reversal Dualities, and Antipodal Decoupling).**
*Let $f, g \in \mathbb{Z}[T]$ be non-constant polynomials with single-site joint root-multiplicity law $\mathcal{J}_{f,g}$ supported on $\Sigma_f \times \Sigma_g$, and let $S_k(\delta) = \{\delta, \dots, \delta+k-1\}$ with $k \ge 1$ and $\delta \in \mathbb{Z}$.*

*(a) **Delay-Buffer Automaton:** Let $p \to \infty$ along a sequence of primes satisfying **single-block multi-site Galois linear disjointness**: for every fixed horizon $M \ge 1$, the splitting fields $L_s$ of $\{f(x) - (t - s),\, g(y) - (t - s)\}$ over $\mathbb{F}_p(t)$ are linearly disjoint across distinct shifts $s \in \{0, 1, \dots, M\}$, so that the scan-indexed pairs $(\widetilde{X}_s, \widetilde{Y}_s)_{s=0}^{M} = (R_f(t-s), R_g(t-s))_{s=0}^{M}$ converge in distribution to $\mathcal{J}_{f,g}^{\otimes (M+1)}$ within $O_M(p^{-1/2})$ as $p \to \infty$. Then the causal coordinate-cover dynamic program for $H_p(f, g; S_k(\delta))$ is governed in the $p \to \infty$ limit by an exact finite-state Markov chain on the reachable subset $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$ of:*
- *$\mathcal{S}_{\mathrm{canon}}(S_k(0))$ if $\delta = 0$;*
- *$\mathcal{S}_{\mathrm{canon}}(S_k(0)) \times \Sigma_g^{\delta}$ if $\delta > 0$, with state $(v, \mathbf{b})$ where $\mathbf{b} = (b_1, \dots, b_\delta) \in \Sigma_g^\delta$ stores $(\widetilde{Y}_{t-\delta}, \dots, \widetilde{Y}_{t-1})$; under a fresh draw $(X_{\mathrm{new}}, Y_{\mathrm{new}}) = (\widetilde{X}_t, \widetilde{Y}_t) \sim \mathcal{J}_{f,g}$ at scan step $t$, the transition updates*
  $$(v', b_0) \;=\; F_{\mathrm{canon}}(v, X_{\mathrm{new}}, b_1), \qquad \mathbf{b}' \;=\; (b_2, \dots, b_\delta, Y_{\mathrm{new}});$$
- *$\mathcal{S}_{\mathrm{canon}}(S_k(0)) \times \Sigma_f^{|\delta|}$ if $\delta < 0$, with state $(v, \mathbf{b})$ where $\mathbf{b} = (b_1, \dots, b_{|\delta|}) \in \Sigma_f^{|\delta|}$ stores $(\widetilde{X}_{t'-|\delta|}, \dots, \widetilde{X}_{t'-1})$ at shifted scan step $t' = t + |\delta|$; under a fresh draw $(X_{\mathrm{new}}, Y_{\mathrm{new}}) = (\widetilde{X}_{t'}, \widetilde{Y}_{t'}) \sim \mathcal{J}_{f,g}$, the transition updates*
  $$(v', b_0) \;=\; F_{\mathrm{canon}}(v, b_1, Y_{\mathrm{new}}), \qquad \mathbf{b}' \;=\; (b_2, \dots, b_{|\delta|}, X_{\mathrm{new}}).*$$
*In all three cases, the asymptotic coordinate-cover density $2\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) := \lim_{p \to \infty} \frac{2}{p}\tau(\Gamma_p(f, g; S_k(\delta)))$ equals $2\,\mathbb{E}_{\pi}[b_0]$ on the unique bottom strongly connected component of $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$.*

*(b) **Transpose Duality and Time-Reversal Reflection Symmetry:** Let $\mathcal{J}_{g,f}(y, x) := \mathcal{J}_{f,g}(x, y)$ be the transposed joint law, and define the **zero-avoidance distance** of $S_k(\delta)$ from the origin $0 \in \mathbb{Z}$ by*
$$d_0(\delta) \;:=\; \mathrm{dist}\bigl(0, S_k(\delta)\bigr) \;=\; \max\bigl(0,\; \delta,\; -(k-1)-\delta\bigr) \;=\; \begin{cases} 0 & \text{if } -(k-1) \le \delta \le 0, \\ \delta & \text{if } \delta \ge 1, \\ -(k-1)-\delta & \text{if } \delta \le -k. \end{cases}$$
*For every integer width $k \ge 1$ and every lag $\delta \in \mathbb{Z}$, two complementary symmetries hold around the half-integer reflection axis $\delta = -\frac{k-1}{2}$ ($\delta \leftrightarrow \delta^* := -(k-1)-\delta$):*
1. ***Exact Finite-Prime Transpose Duality:** Plain coordinate transposition $\mathcal{T}(u, v) := (v, u)$ is a weight-preserving bipartite graph isomorphism $\Gamma_p(f, g; S_k(\delta)) \xrightarrow{\sim} \Gamma_p(g, f; S_k(-(k-1)-\delta))$ for every prime $p$, yielding the exact finite-prime identity $\tau(\Gamma_p(f, g; S_k(\delta))) = \tau(\Gamma_p(g, f; S_k(-(k-1)-\delta)))$ and the asymptotic transpose identity*
   $$\gamma^*\bigl(S_k(\delta); \mathcal{J}_{f,g}\bigr) \;=\; \gamma^*\bigl(S_k(-(k-1)-\delta); \mathcal{J}_{g,f}\bigr).$$
2. ***Asymptotic Time-Reversal Reflection Symmetry:** Cyclic negation $\mathcal{R}(u, v) := (-u \bmod p, -v \bmod p)$ preserves the vertical and horizontal parts while reversing the cyclic scan order $t \mapsto -t \pmod p$ and reflecting $v - u \in S_k(\delta) \iff (-v) - (-u) \in S_k(-(k-1)-\delta)$. Because reversing an i.i.d. sequence $(\widetilde{X}_s, \widetilde{Y}_s)_{s \in \mathbb{Z}} \sim \mathcal{J}_{f,g}^{\otimes \mathbb{Z}}$ preserves its joint distribution for **every** single-site law $\mathcal{J}_{f,g}$ (whether symmetric or asymmetric), we have*
   $$\gamma^*\bigl(S_k(\delta); \mathcal{J}_{f,g}\bigr) \;=\; \gamma^*\bigl(S_k(-(k-1)-\delta); \mathcal{J}_{f,g}\bigr) \;=\; \gamma^*\bigl(S_k(\delta); \mathcal{J}_{g,f}\bigr).$$
*Consequently, on the exterior zero-avoiding region $d_0(\delta) \ge 1$ ($\delta \ge 1$ or $\delta \le -k$), where each $d = d_0(\delta) \ge 1$ corresponds to the single reflection pair $\delta \in \{d, -(k-1)-d\}$, $\gamma^*(S_k(\delta); \mathcal{J}_{f,g})$ depends on $\delta$ solely through $d_0(\delta)$. If in addition $\mathcal{J}_{f,g}$ is supported on the diagonal $X = Y$ (including all self-paired curves $f = g$), then all $k$ interior zero-containing lags $-(k-1) \le \delta \le 0$ ($d_0(\delta) = 0$) have $2\gamma^*(S_k(\delta); \mathcal{J}_{f,f}) = 2\,\mathbb{E}[R_f] = 2$, so $\gamma^*(S_k(\delta); \mathcal{J}_{f,f})$ is a function of $d_0(\delta)$ alone across all $\delta \in \mathbb{Z}$.*

*(c) **Antipodal Decoupling ($\delta_p = (p-1)/2 \equiv -1/2 \pmod p$) under Two-Block Galois Linear Disjointness:** Because $\delta_p = (p-1)/2 \equiv -\frac{1}{2} \pmod p$ is a fixed rational shift in $\mathbb{F}_p$, assume in addition the **two-block antipodal Galois linear disjointness hypothesis**: for every fixed $M \ge 1$ and all sufficiently large primes $p$, the compositum of the local block splitting fields $L_{[0,M]} := \prod_{s=0}^{M} L_s$ (generated by the roots of $f(x)-(t-s)=0$ and $g(y)-(t-s)=0$ for $0 \le s \le M$) and the compositum of the antipodally shifted block splitting fields $L_{-1/2 + [0,M]} := \prod_{s=0}^{M} L_{s + 1/2}$ (generated by the roots of $f(x)-(t-\frac{1}{2}-s)=0$ and $g(y)-(t-\frac{1}{2}-s)=0$ for $0 \le s \le M$) are linearly disjoint over $\mathbb{F}_p(t)$. Then $(R_f(u-s), R_g(u+\delta_p-s))_{s=0}^{M}$ converges in distribution as $p \to \infty$ to the product measure $(\mu_f \otimes \mu_g)^{\otimes (M+1)}$, and*
$$\lim_{p \to \infty} \frac{2\,\tau\bigl(\Gamma_p(f, g; S_k((p-1)/2))\bigr)}{p} \;=\; 2\gamma^*\bigl(S_k(0); \mu_f \otimes \mu_g\bigr) \;=\; \lim_{|\delta| \to \infty} 2\gamma^*\bigl(S_k(\delta); \mathcal{J}_{f,g}\bigr).$$

*Proof.*
(a) **Delay-buffer representation and explicit cyclic-to-block boundary estimate:** Under the decreasing cyclic scan $u \equiv -t \pmod p$, the canonical recursion $F_{\mathrm{canon}}$ at step $t$ consumes the input pair $(X_{-t}, Y_{-t}^{(\delta)}) = (R_f(-t), R_g(-t+\delta)) = (\widetilde{X}_t, \widetilde{Y}_{t-\delta})$, where $(\widetilde{X}_s, \widetilde{Y}_s) = (R_f(-s), R_g(-s))$.
- When $\delta > 0$, storing the last $\delta$ horizontal draws in the FIFO buffer $\mathbf{b}(t) = (b_1, \dots, b_\delta) := (\widetilde{Y}_{t-\delta}, \dots, \widetilde{Y}_{t-1}) \in \Sigma_g^\delta$ allows a fresh draw $(X_{\mathrm{new}}, Y_{\mathrm{new}}) := (\widetilde{X}_t, \widetilde{Y}_t)$ at step $t$ to feed $(X_{\mathrm{new}}, b_1) = (\widetilde{X}_t, \widetilde{Y}_{t-\delta})$ into $F_{\mathrm{canon}}(v, X_{\mathrm{new}}, b_1)$ while shifting the buffer to $\mathbf{b}(t+1) = (b_2, \dots, b_\delta, Y_{\mathrm{new}})$.
- When $\delta < 0$, setting $|\delta| = -\delta > 0$ and $t' := t + |\delta|$ rewrites $(\widetilde{X}_t, \widetilde{Y}_{t-\delta}) = (\widetilde{X}_{t'-|\delta|}, \widetilde{Y}_{t'})$; storing the last $|\delta|$ vertical draws in $\mathbf{b}(t') = (b_1, \dots, b_{|\delta|}) := (\widetilde{X}_{t'-|\delta|}, \dots, \widetilde{X}_{t'-1}) \in \Sigma_f^{|\delta|}$ feeds $(b_1, Y_{\mathrm{new}}) = (\widetilde{X}_{t'-|\delta|}, \widetilde{Y}_{t'})$ into $F_{\mathrm{canon}}(v, b_1, Y_{\mathrm{new}})$ while shifting $\mathbf{b}(t'+1) = (b_2, \dots, b_{|\delta|}, X_{\mathrm{new}})$.

To pass rigorously from the finite cyclic graph $\Gamma_p(f, g; S_k(\delta))$ to the stationary Markov chain limit on $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$ at fixed $(k, \delta)$, fix an auxiliary block length $M > k + |\delta|$ and partition $\mathbb{Z}/p\mathbb{Z}$ (for $p > M$) into $Q := \lfloor p/M \rfloor$ contiguous blocks $I_q := \{(q-1)M, \dots, qM-1\}$ ($1 \le q \le Q$) of length $M$ plus a remainder $I_0$ of length $p - QM < M$. For each block $I_q$ ($1 \le q \le Q$), let $\Gamma_p^{\mathrm{int}}(I_q)$ denote the internal bipartite subgraph induced by vertical vertices $u \in I_q$ and horizontal vertices $v \in I_q + \delta$ whose edges $(u, u+\delta+j)$ ($0 \le j \le k-1$) have both endpoints inside $I_q$ and $I_q + \delta$ (which holds for all $M - (k-1) \le M$ non-boundary vertical sites in $I_q$). Notice that $\tau(\Gamma_p^{\mathrm{int}}(I_q))$ is a deterministic function $\tau_M\bigl((\widetilde{X}_s, \widetilde{Y}_s)_{s \in J_q}\bigr)$ of the multiplicity pairs on a single contiguous scan block $J_q$ of length $M' := M + |\delta|$ (covering both $I_q$ and $I_q + \delta$). Because deleting all inter-block edges and $I_0$ gives a valid lower bound on $\tau(\Gamma_p)$, while adding to the union of optimal block covers all vertical vertices in $I_0$ together with the $(k-1)$ boundary vertical vertices of each block $I_q$ gives a valid global vertex cover of $\Gamma_p(f, g; S_k(\delta))$, setting $K_{\max} := \max(\Sigma_f \cup \Sigma_g)$ yields the deterministic sandwich inequality
$$\sum_{q=1}^{Q} \tau\bigl(\Gamma_p^{\mathrm{int}}(I_q)\bigr) \;\le\; \tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr) \;\le\; \sum_{q=1}^{Q} \tau\bigl(\Gamma_p^{\mathrm{int}}(I_q)\bigr) \;+\; \bigl(Q(k-1) + M\bigr) K_{\max}.$$
Dividing by $p/2$ and using $\frac{QM}{p} = 1 - O(\frac{M}{p})$ gives
$$\left|\frac{2\,\tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr)}{p} \;-\; \frac{1}{Q}\sum_{q=1}^{Q} \frac{2\,\tau\bigl(\Gamma_p^{\mathrm{int}}(I_q)\bigr)}{M}\right| \;\le\; \frac{2(k-1)K_{\max}}{M} \;+\; \frac{4M K_{\max}}{p}.$$
Now keep $M$ fixed and send $p \to \infty$ first: by single-block multi-site Galois linear disjointness at horizon $M' = M + |\delta|$ and the Chebotarev--Weil bound [1, Theorem 3; 2, Theorem 1], the empirical block average $\frac{1}{Q}\sum_{q=1}^Q \frac{2}{M}\tau(\Gamma_p^{\mathrm{int}}(I_q))$ converges within $O_{k,\delta,M}(p^{-1/2})$ to the block expectation $\frac{2}{M}\mathbb{E}_{\mathcal{J}_{f,g}^{\otimes (M+|\delta|)}}[\tau_M]$ under i.i.d. draws from $\mathcal{J}_{f,g}$, which equals the $M$-step average cost $\frac{2}{M}\mathbb{E}[\sum_{t=1}^{M-k+1} b_0(t)]$ of the delay-buffer Markov chain on $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$. Thus for every fixed $M > k + |\delta|$,
$$\limsup_{p \to \infty} \left|\frac{2\,\tau\bigl(\Gamma_p(f, g; S_k(\delta))\bigr)}{p} \;-\; \frac{2}{M}\mathbb{E}_{\mathcal{J}_{f,g}^{\otimes (M+|\delta|)}}[\tau_M]\right| \;\le\; \frac{2(k-1)K_{\max}}{M}.$$
Finally, send $M \to \infty$: because $v_{k-1} - v_0 \le (k-1)K_{\max}$ is uniformly bounded, $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$ is finite, and the Cesàro average $\frac{2}{M}\mathbb{E}[\tau_M]$ converges as $M \to \infty$ at rate $O(1/M)$ to the stationary drift $2\,\mathbb{E}_\pi[b_0]$ on the unique bottom strongly connected component of $\mathcal{S}_k(\delta; \mathcal{J}_{f,g})$.

(b) **Transpose and time-reversal dualities:** First, for every prime $p$, consider plain coordinate transposition $\mathcal{T} : U \times V \to V \times U$ defined by $\mathcal{T}(u, v) := (u', v') = (v, u)$, which swaps the vertical and horizontal parts (so $u' = v$ has vertical weight $R_g(u') = R_g(v)$ and $v' = u$ has horizontal weight $R_f(v') = R_f(u)$). Under $\mathcal{T}$, an edge $(u, v)$ of $\Gamma_p(f, g; S_k(\delta))$ satisfies
$$v - u \in \{\delta, \dots, \delta + k - 1\} \;\Longleftrightarrow\; v' - u' = -(v - u) \in \{-(k-1)-\delta, \dots, -\delta\} = S_k(-(k-1)-\delta).$$
Hence $\mathcal{T}$ is an exact weight-preserving isomorphism between $\Gamma_p(f, g; S_k(\delta))$ and $\Gamma_p(g, f; S_k(-(k-1)-\delta))$ on every prime $p$, proving $\tau(\Gamma_p(f, g; S_k(\delta))) = \tau(\Gamma_p(g, f; S_k(-(k-1)-\delta)))$ and, upon dividing by $p/2$ and taking $p \to \infty$, $\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) = \gamma^*(S_k(-(k-1)-\delta); \mathcal{J}_{g,f})$.

Second, consider cyclic time reversal $\mathcal{R} : U \times V \to U \times V$ defined by $\mathcal{R}(u, v) := (u'', v'') = (-u \bmod p, -v \bmod p)$, which keeps $u''$ on the vertical part with weight $R_f^{(-)}(u'') := R_f(-u'' \bmod p) = R_f(u)$ and $v''$ on the horizontal part with weight $R_g^{(-)}(v'') := R_g(-v'' \bmod p) = R_g(v)$. Under $\mathcal{R}$,
$$v - u \in S_k(\delta) \;\Longleftrightarrow\; v'' - u'' = -(v - u) \in S_k(-(k-1)-\delta).$$
Thus $\tau(\Gamma_p(f, g; S_k(\delta)))$ equals the minimum weighted vertex cover of the canonical window $S_k(-(k-1)-\delta)$ driven by the time-reversed multiplicity sequence $(R_f^{(-)}(-t), R_g^{(-)}(-t)) = (R_f(t), R_g(t))$. Because reversing the time index of an i.i.d. sequence $(X_t, Y_t)_{t \in \mathbb{Z}} \sim \mathcal{J}_{f,g}^{\otimes \mathbb{Z}}$ leaves its joint law $\mathcal{J}_{f,g}^{\otimes \mathbb{Z}}$ unchanged for *every* single-site distribution $\mathcal{J}_{f,g}$, the block expectation $\mathbb{E}_{\mathcal{J}_{f,g}^{\otimes (M+|\delta|)}}[\tau_M]$ in part (a) is invariant under $\mathcal{R}$, giving $\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) = \gamma^*(S_k(-(k-1)-\delta); \mathcal{J}_{f,g}) = \gamma^*(S_k(\delta); \mathcal{J}_{g,f})$. The remaining claims in (b) follow immediately.

(c) **Antipodal decoupling under two-block Galois linear disjointness:** When $\delta_p = (p-1)/2 \equiv -\frac{1}{2} \pmod p$, apply the block-cutting sandwich inequality of part (a) at fixed block size $M > k$: for each block $I_q$, the internal cover $\tau(\Gamma_p^{\mathrm{int}}(I_q))$ depends simultaneously on the vertical multiplicities $\{R_f(u-s)\}_{s=0}^{M-1}$ in the local block $I_q$ and the horizontal multiplicities $\{R_g(u+\delta_p-s)\}_{s=0}^{M-1} = \{R_g(u-\frac{1}{2}-s)\}_{s=0}^{M-1}$ in the antipodally shifted block $I_q + \delta_p$. Under the two-block antipodal Galois linear disjointness hypothesis, the Chebotarev--Weil bound applied to the compositum $L_{[0,M]} \cdot L_{-1/2 + [0,M]}$ over $\mathbb{F}_p(t)$ implies that the joint empirical distribution of $\bigl(R_f(u-s), R_g(u+\delta_p-s)\bigr)_{s=0}^{M-1}$ converges within $O_M(p^{-1/2})$ to the fully decoupled product law $(\mu_f \otimes \mu_g)^{\otimes M}$. Taking $p \to \infty$ first and then $M \to \infty$ yields $\lim_{p\to\infty} \frac{2}{p}\tau(\Gamma_p(f, g; S_k((p-1)/2))) = 2\gamma^*(S_k(0); \mu_f \otimes \mu_g)$, which coincides with $\lim_{|\delta|\to\infty} 2\gamma^*(S_k(\delta); \mathcal{J}_{f,g})$ because a FIFO delay buffer of length $|\delta| > M$ decouples the $X$ and $Y$ inputs identically over any $M$-step block. $\square$

### 2.2 Verification of Single-Block and Two-Block Galois Disjointness vs. Half-Integer Branch Resonance

Because $\delta_p = (p-1)/2 \equiv -\frac{1}{2} \pmod p$ is a fixed rational shift in $\mathbb{F}_p$, index separation in $\mathbb{Z}/p\mathbb{Z}$ alone is never sufficient for Theorem 1(c) when the finite branch loci $\mathcal{B}_f, \mathcal{B}_g \subset \overline{\mathbb{Q}}$ contain rational values differing by $\frac{1}{2} \bmod 1$. Likewise, in Theorem 1(a), simple branch-point disjointness fails if $\mathrm{diam}(\mathcal{B}_f) \in \mathbb{Z}_{\ge 1}$ (as occurs for the Dickson cubic $f(x) = x^3 - 3x$, where $\mathcal{B}_f = \{-2, +2\}$ overlaps at shift distance $4$). The following proposition establishes both single-block and two-block Galois linear disjointness for all three families studied in Sections 3–5, and exhibits an explicit composite dihedral quartic family where half-integer branch resonance violates Theorem 1(c) on every odd prime $p$.

**Proposition 1 (Multi-Site Galois Disjointness for Kummer and Morse $S_3$ Curves vs. Persistent Antipodal Branch Resonance).**
*(i) **Pure-Power $C_m$ and Nested Kummer $\mathcal{J}_{m,dm}$ ($f(x) = x^m, g(y) = y^{dm}$):** Here $\mathcal{B}_f = \mathcal{B}_g = \{0\}$. For any fixed $M \ge 1$ and all primes $p > 2M + 2$ with $p \equiv 1 \pmod{dm}$, the $2M + 2$ shifts $\{0, 1, \dots, M\} \cup \{-\frac{1}{2}, \frac{1}{2}, \dots, M - \frac{1}{2}\}$ are pairwise distinct in $\mathbb{F}_p$, so the linear polynomials $t - c$ are pairwise coprime in $\overline{\mathbb{F}}_p[t]$ and the Kummer splitting fields $\mathbb{F}_p(t)((t-c)^{1/(dm)})$ satisfy both single-block (Theorem 1(a)) and two-block antipodal (Theorem 1(c)) Galois linear disjointness over $\mathbb{F}_p(t)$.*

*(ii) **Morse Dickson Cubic $S_3$ ($f(x) = g(y) = x^3 - 3x$):** Although $\mathcal{B}_f = \{-2, +2\}$ overlaps at integer shift distance $4$ ($-2 + 4 = +2$), for **any** $m$ distinct shifts $c_1, \dots, c_m \in \mathbb{F}_p$ with $p > 4m$ (covering both single-block shifts $\{0, \dots, M\}$ and two-block antipodal shifts $\{0, \dots, M\} \cup \{-\frac{1}{2}, \dots, M-\frac{1}{2}\}$), the splitting fields $K_i$ of $f(x) - (t - c_i)$ ($1 \le i \le m$) are linearly disjoint over $\mathbb{F}_p(t)$ with joint Galois group $\mathrm{Gal}(K_1 \cdots K_m / \mathbb{F}_p(t)) \cong S_3^m$.*

*(iii) **Persistent Antipodal Branch Resonance Counterexample at $\delta_p = (p-1)/2$:** Consider the composite dihedral quartic pair*
$$f(x) \;=\; (x^2 + x + 1)^2, \qquad g(y) \;=\; (y^2 + y)^2,$$
*whose finite branch loci over $\mathbb{Q}$ are $\mathcal{B}_f = \{0, \frac{9}{16}\}$ and $\mathcal{B}_g = \{0, \frac{1}{16}\}$. Because $\frac{9}{16} - \frac{1}{16} = \frac{1}{2} \notin \mathbb{Z}$, for every non-zero integer lag $\delta \in \mathbb{Z} \setminus \{0\}$ the outer branch points $\frac{9}{16}$ and $\frac{1}{16} + \delta$ are disjoint for all $p > 2|\delta| + 1$, and at $k = 1$ the large-lag limit is $2\gamma^*(S_1(0); \mu_f \otimes \mu_g) = \frac{5}{8} = 0.625$. However, at the antipodal shift $\delta_p = (p-1)/2 \equiv -\frac{1}{2} \pmod p$, the shifted horizontal branch point $\frac{1}{16} - \delta_p \equiv \frac{9}{16} \pmod p$ collides with the outer branch point of $f$ for **every** odd prime $p > 3$, locking the quadratic subfields of $f(x) - t$ and $g(y) - (t + \delta_p)$ onto the same extension $\mathbb{F}_p(t)(\sqrt{9 - 16t})$ and raising the asymptotic antipodal cover density at $k = 1$ to*
$$\lim_{p \to \infty} \frac{2\,\tau\bigl(\Gamma_p(f, g; S_1((p-1)/2))\bigr)}{p} \;=\; \frac{3}{4} \;=\; 0.750 \;\ne\; \frac{5}{8} \;=\; 0.625 \;=\; \lim_{|\delta| \to \infty} 2\gamma^*\bigl(S_1(\delta); \mathcal{J}_{f,g}\bigr).$$

*Proof.*
Part (i) is immediate from Kummer theory since $t - c_i$ have distinct roots of multiplicity $1$ in $\overline{\mathbb{F}}_p$.

For part (ii), we adapt the Morse polynomial independence argument of Kurlberg [9, Lemma 6] and Kurlberg--Rosenzweig [10, Propositions 9–10]. Let $c_1, \dots, c_m \in \mathbb{F}_p$ be distinct with $p > 4m$, and let $G := \mathrm{Gal}(K_1 \cdots K_m / \mathbb{F}_p(t)) \le S_3^m$. First, the quadratic subfield of $K_i$ is $F_i = \mathbb{F}_p(t)(\sqrt{\Delta_i(t)})$, where $\Delta_i(t) = -27\bigl((t - c_i)^2 - 4\bigr) = -27(t - (c_i - 2))(t - (c_i + 2))$. By Kummer theory, $F_1, \dots, F_m$ are linearly disjoint over $\overline{\mathbb{F}}_p(t)$ if and only if for every nonempty subset $I \subseteq \{1, \dots, m\}$, the product $\prod_{i \in I} ((t - c_i)^2 - 4)$ is not a square in $\overline{\mathbb{F}}_p[t]$, i.e., has at least one root of odd multiplicity. Every root $r$ is of the form $c_i - 2$ or $c_i + 2$ for at most two indices $i \in I$; for every root to have even multiplicity, the set $\{c_i - 2 : i \in I\}$ would have to coincide with $\{c_i + 2 : i \in I\}$, making the nonempty subset $\{c_i : i \in I\} \subset \mathbb{F}_p$ invariant under translation by $+4 \pmod p$, which is impossible since $4 \not\equiv 0 \pmod p$ and $1 \le |I| \le m < p/4$. Hence $\mathrm{Gal}(F_1 \cdots F_m / \overline{\mathbb{F}}_p(t)) \cong (\mathbb{Z}/2\mathbb{Z})^m$, so the joint sign homomorphism $\mathrm{sgn}^m : G_{\mathrm{geom}} \to (\mathbb{Z}/2\mathbb{Z})^m$ on the geometric Galois group $G_{\mathrm{geom}} := \mathrm{Gal}(\overline{\mathbb{F}}_p K_1 \cdots K_m / \overline{\mathbb{F}}_p(t))$ is surjective. Second, for each $i \in \{1, \dots, m\}$, choose an element $\sigma_i \in G_{\mathrm{geom}}$ with $\mathrm{sgn}^m(\sigma_i) = (1, \dots, -1, \dots, 1)$ (equal to $-1$ only in coordinate $i$). In $S_3$, every element of sign $-1$ is a transposition (order $2$), whereas every element of sign $+1$ lies in $A_3$ (order dividing $3$); therefore $\tau_i := \sigma_i^3 \in G_{\mathrm{geom}}$ acts as a transposition on $K_i$ and as the identity on $K_j$ for all $j \ne i$. Since the projection of $G_{\mathrm{geom}}$ to each factor $K_i$ is transitive (hence all of $S_3$) and normalizes the transposition $\tau_i$ inside $1 \times \dots \times S_3 \times \dots \times 1$, $G_{\mathrm{geom}}$ contains all $3$ transpositions in each coordinate independently, forcing $G_{\mathrm{geom}} = S_3^m$ and thus $G = S_3^m$.

For part (iii), let $u(x) := x^2 + x + 1 = \frac{(2x+1)^2 + 3}{4}$ and $v(y) := y^2 + y = \frac{(2y+1)^2 - 1}{4}$, so $f(x) = u(x)^2$ and $g(y) = v(y)^2$ have identical asymptotic single-site marginal laws $\mu_f = \mu_g = \{0 : \frac{5}{8}, 2 : \frac{1}{4}, 4 : \frac{1}{8}\}$ for $p > 3$ (for instance, $g(y) = t \ne 0$ requires $t = r^2$ with probability $\frac{1}{2}$, and the product $(4r+1)(-4r+1) = 1 - 16t$ of the two inner discriminants is a non-square with probability $\frac{1}{2}$, giving $R_g = 2$ with probability $\frac{1}{4}$, and a square with probability $\frac{1}{2}$, giving $R_g \in \{0, 4\}$ equally with probability $\frac{1}{8}$ each). Under independent draws $\mu_f \otimes \mu_g$, at $k = 1$ we have $\mathbb{E}_{\mu_f \otimes \mu_g}[\min(R_f, R_g)] = 2(\frac{1}{4}\cdot\frac{1}{4} + \frac{1}{4}\cdot\frac{1}{8} + \frac{1}{8}\cdot\frac{1}{4}) + 4(\frac{1}{8}\cdot\frac{1}{8}) = \frac{5}{16}$, so $2\gamma^*(S_1(0); \mu_f \otimes \mu_g) = \frac{5}{8} = 0.625$. Now set $\delta_p = (p-1)/2 \equiv -\frac{1}{2} \pmod p$. For $t \in \mathbb{F}_p \setminus \{0, \frac{1}{2}\}$, $f(x) = t$ requires $t = s^2$ ($s \in \mathbb{F}_p^\times$, probability $\frac{1}{2}$) and $(2x+1)^2 = 4s - 3$ or $-4s - 3$. Notice that the product of the two quadratic discriminants is
$$(4s - 3)(-4s - 3) \;=\; 9 - 16s^2 \;=\; 9 - 16t.$$
Simultaneously, $g(y) = t + \delta_p \equiv t - \frac{1}{2} \pmod p$ requires $t - \frac{1}{2} = r^2$ ($r \in \mathbb{F}_p^\times$, probability $\frac{1}{2}$, which is independent of $t = s^2$ since $s^2 - r^2 = \frac{1}{2}$ defines a non-degenerate conic) and $(2y+1)^2 = 4r + 1$ or $-4r + 1$, whose discriminant product is **identical**:
$$(4r + 1)(-4r + 1) \;=\; 1 - 16r^2 \;=\; 1 - 16\bigl(t - \tfrac{1}{2}\bigr) \;=\; 9 - 16t!$$
Consequently, whenever both $t = s^2$ and $t - \frac{1}{2} = r^2$ are squares in $\mathbb{F}_p^\times$ (asymptotic density $\frac{1}{4}$):
- if $\bigl(\frac{9 - 16t}{p}\bigr) = -1$ (conditional probability $\frac{1}{2}$, overall density $\frac{1}{8}$), then in BOTH equations exactly one of the two branches is a square, forcing $(R_f(t), R_g(t+\delta_p)) = (2, 2)$ with probability $\frac{1}{8}$ and eliminating $(2, 4)$ and $(4, 2)$ completely ($\mathbb{P}((2, 4)) = \mathbb{P}((4, 2)) = 0$);
- if $\bigl(\frac{9 - 16t}{p}\bigr) = +1$ (conditional probability $\frac{1}{2}$, overall density $\frac{1}{8}$), then $(4s-3, -4s-3)$ and $(4r+1, -4r+1)$ each have Legendre symbols $(+1, +1)$ or $(-1, -1)$ independently with probability $\frac{1}{2}$ each (since $\mathbb{F}_p(s, r)(\sqrt{4s-3}, \sqrt{4r+1})$ has degree $4$ over $\mathbb{F}_p(s, r)$), yielding $(R_f(t), R_g(t+\delta_p)) \in \{(0, 0), (0, 4), (4, 0), (4, 4)\}$ with probability $\frac{1}{32}$ each.
Thus at $k = 1$, $\min(R_f(t), R_g(t+\delta_p))$ takes the value $2$ with probability $\frac{1}{8}$ (at $(2, 2)$) and $4$ with probability $\frac{1}{32}$ (at $(4, 4)$), giving $\lim_{p\to\infty} \frac{2}{p}\tau(\Gamma_p(f, g; S_1((p-1)/2))) = 2\bigl(2 \cdot \frac{1}{8} + 4 \cdot \frac{1}{32}\bigr) = \frac{3}{4} = 0.750 > \frac{5}{8}$. $\square$

> **Remark 1 (State-Space Asymmetry and Interior Zero-Lag Splitting).** First, although $\gamma^*(S_k(\delta); \mathcal{J}_{f,g}) = \gamma^*(S_k(-(k-1)-\delta); \mathcal{J}_{f,g})$ holds for every law $\mathcal{J}_{f,g}$ by Theorem 1(b), the causal scan processes vertical constraints $\widetilde{X}_t$ immediately and horizontal constraints $\widetilde{Y}_t$ across $k-1$ steps. Consequently, buffering $\Sigma_g$ ($\delta > 0$) versus buffering $\Sigma_f$ ($\delta < 0$) produces non-isomorphic Markov chains of radically different sizes: as we prove in Theorem 2(ii), for self-paired $C_m$ at unit zero-avoidance distance $d_0(\delta) = 1$, the positive-lag chain $\delta = 1$ has only $|\mathcal{S}_k(1; \mathcal{J}_{C_m, C_m})| = k + 1$ states, whereas its reflection dual $\delta = -k$ has $|\mathcal{S}_k(-k; \mathcal{J}_{C_m, C_m})| = 3 \cdot 2^{k-1} - 1$ states. Thus Theorem 1(b) provides an exponential state-space reduction whenever $\delta \le -k$ by replacing $\delta$ with $\delta^* = -(k-1)-\delta \ge 1$. Second, for non-diagonal laws $\mathcal{J}_{f,g}$ (such as the upper-triangular nested Kummer law $\mathcal{J}_{2,4}$ in Section 4), the level set $d_0(\delta) = 0$ consists of the $k$ interior lags $\delta \in \{-(k-1), \dots, 0\}$ where $0 = \delta + r$ lies at interior index $r = -\delta \in \{0, \dots, k-1\}$ inside $S_k(\delta)$; time-reversal symmetry $\mathcal{R}$ pairs $r \leftrightarrow k - 1 - r$ and therefore bounds the number of distinct interior values on $d_0(\delta) = 0$ by **at most $\lceil k/2 \rceil$** for every $k \ge 1$. While $2\gamma^*(S_k(\delta); \mathcal{J}_{2,4})$ remains constant across $d_0(\delta) = 0$ for $1 \le k \le 3$, at the verified widths $k = 4, 5$ this upper bound $\lceil k/2 \rceil$ is attained with equality ($2$ and $3$ distinct interior values, respectively; see Theorem 3(iii)).

---

## 3. Self-Paired Superelliptic Shifted Windows $y^m - x^m \in S_k(\delta)$

Let $f(x) = x^m$ and $g(y) = y^m$ for an integer $m \ge 2$ on primes $p \equiv 1 \pmod m$. The single-site joint law $\mathcal{J}_{C_m, C_m}$ is supported on the diagonal:
$$\mathcal{J}_{C_m, C_m} \;=\; \left\{(0, 0) : \frac{m-1}{m},\quad (m, m) : \frac{1}{m}\right\}.$$
At $\delta = 0$, this diagonal lock forces $2\gamma^*(S_k(0); \mathcal{J}_{C_m, C_m}) = 2$ for all $k \ge 1$. Shifting the window by $\delta$ breaks the diagonal lock as soon as $0 \notin S_k(\delta)$ ($d_0(\delta) \ge 1$) and reveals four exact solvable regimes.

**Theorem 2 (Four Exact Closed-Form Regimes for Self-Paired Superelliptic Shifted Windows).**
*Let $m \ge 2$, $k \ge 1$, $\delta \in \mathbb{Z}$, and $d_0(\delta) = \max(0, \delta, -(k-1)-\delta)$. Then:*

*(i) **Zero-Containing Degeneracy ($d_0(\delta) = 0$, i.e., $-(k-1) \le \delta \le 0$):** The reachable state space has cardinality $|\mathcal{S}_k(\delta; \mathcal{J}_{C_m, C_m})| = 2^{-\delta}$, and the asymptotic coordinate-cover density is identically*
$$2\gamma^*\bigl(S_k(\delta); \mathcal{J}_{C_m, C_m}\bigr) \;=\; 2.$$

*(ii) **Universal Unit-Lag Run-Length Formula ($d_0(\delta) = 1$, i.e., $\delta = 1$ or $\delta = -k$):** The reachable state space has cardinality $|\mathcal{S}_k(1; \mathcal{J}_{C_m, C_m})| = k + 1$ at $\delta = 1$ and $|\mathcal{S}_k(-k; \mathcal{J}_{C_m, C_m})| = 3 \cdot 2^{k-1} - 1$ at $\delta = -k$. In both cases, the exact asymptotic coordinate-cover density is*
$$2\gamma^*\bigl(S_k(1); \mathcal{J}_{C_m, C_m}\bigr) \;=\; 2\gamma^*\bigl(S_k(-k); \mathcal{J}_{C_m, C_m}\bigr) \;=\; 2\left(1 - \left(\frac{m-1}{m}\right)^k\right).$$
*Consequently, a single unit shift $\delta = 1$ restores the $1.80$ window horizon from $k_{\max}(0) = 0$ to*
$$k_{\max}\bigl(1; \mathcal{J}_{C_m, C_m}\bigr) \;=\; \left\lfloor \frac{\ln 10}{\ln(m/(m-1))} \right\rfloor \;=\; \begin{cases} 3 & \text{for } m = 2 \;\;(2\gamma^* = \frac{7}{4} = 1.75 < 1.80), \\[2pt] 5 & \text{for } m = 3 \;\;(2\gamma^* = \frac{422}{243} \approx 1.736626 < 1.80), \\[2pt] 8 & \text{for } m = 4 \;\;(2\gamma^* = \frac{58975}{32768} \approx 1.799774 < 1.80). \end{cases}$$

*(iii) **Exact Geometric Lag Decay at $k = 2$ Across All $\delta \in \mathbb{Z}$:** For $k = 2$, the reachable state space has cardinality $|\mathcal{S}_2(\delta; \mathcal{J}_{C_m, C_m})| = 2^{\delta+1} - 1$ for $\delta \ge 1$ and $3 \cdot 2^{-1-\delta} - 1$ for $\delta \le -2$, and for every $\delta \in \mathbb{Z}$:*
$$2\gamma^*\bigl(S_2(\delta); \mathcal{J}_{C_m, C_m}\bigr) \;=\; \frac{4}{m+1} \;+\; \frac{2(m-1)}{m+1}\,m^{-2 d_0(\delta)}.$$

*(iv) **Antipodal / Infinite-Lag Product Measure ($\delta \equiv (p-1)/2 \pmod p$, $\mathcal{J}_{C_m, C_m}^{\mathrm{ind}} = C_m \otimes C_m$):** Under the independent product law $C_m \otimes C_m$, the reachable state space $\mathcal{S}_k(0; C_m \otimes C_m)$ consists of the $2^{k-1}$ vectors $v \in \mathbb{Z}_{\ge 0}^k$ with $v_0 = 0$ and normalized increments $\Delta_j := (v_j - v_{j-1})/m \in \{0, 1\}$ for $1 \le j \le k-1$. The unique stationary distribution $\pi$ has the exact prefix-product form:*
$$\pi(\mathbf{0}) \;=\; \frac{m}{k + m - 1}, \qquad \pi(\Delta) \;=\; \pi(\mathbf{0})\,\frac{1}{m} \prod_{j=1}^{L(\Delta)-1} \left(\frac{1}{m}\right)^{\Delta_j} \left(1 - \frac{1}{m}\right)^{1 - \Delta_j} \quad (\Delta \ne \mathbf{0}),$$
*where $L(\Delta) := \max\{1 \le j \le k-1 : \Delta_j = 1\}$ is the index of the last non-zero increment. Summing $\mathbb{E}_\pi[b_0]$ yields the exact rational drift for all $k \ge 1$ and $m \ge 2$:*
$$2\gamma^*\bigl(S_k; C_m \otimes C_m\bigr) \;=\; \frac{2k}{k + m - 1}.$$
*Thus $2\gamma^*(S_k; C_m \otimes C_m) < 1.80$ holds for all $k \le 9(m-1) - 1$ and equals $1.80$ at $k = 9(m-1)$ ($k \in \{9, 18, 27\}$ for $m \in \{2, 3, 4\}$).*

*Proof.*
Set $p_0 := \frac{m-1}{m}$ and $p_1 := \frac{1}{m}$, and rescale all costs by $1/m$ so that $(X, Y) \in \{(0, 0), (1, 1)\}$.

**(i) Zero-containing regime ($d_0(\delta) = 0$):** When $-(k-1) \le \delta \le 0$, let $r := -\delta \in \{0, 1, \dots, k-1\}$. In the negative-lag automaton of Theorem 1(a), the buffer $\mathbf{b} = (b_1, \dots, b_r) \in \{0, 1\}^r$ stores the last $r$ draws $X_{t-r}, \dots, X_{t-1}$, while $Y_{\mathrm{new}} = X_{\mathrm{new}}$ is fed directly into $F_{\mathrm{canon}}(v, b_1, X_{\mathrm{new}})$. By induction on $t$, the canonical DP vector $v$ is uniquely determined by the buffer $\mathbf{b}$ via $v_i = \sum_{j=1}^{\min(i, r)} b_{r+1-j}$, and at step $t$ the increment $b_0$ equals $b_1 \in \{0, 1\}$. Since $\mathbf{b}$ is a shift register fed by i.i.d. $\mathrm{Bernoulli}(1/m)$ bits, all $2^r = 2^{-\delta}$ buffer words are reachable and $\mathbb{E}[b_0] = m\,\mathbb{P}(b_1 = 1) = 1$, giving $2\gamma^* = 2$.

**(ii) Unit-lag regime ($d_0(\delta) = 1$):** By Theorem 1(b), the drift at $\delta = -k$ equals that at $\delta = 1$. At $\delta = 1$, the buffer has a single slot $b_1 \in \{0, 1\}$, and a fresh draw $(X_{\mathrm{new}}, Y_{\mathrm{new}}) = (Z_t, Z_t)$ with $Z_t \in \{0, 1\}$ updates $(v', b_0) = F_{\mathrm{canon}}(v, Z_t, b_1)$ and $b'_1 = Z_t$. Observe what happens under the two possible values of $Z_t$:
- Whenever $Z_t = 1$ (probability $p_1 = 1/m$), every coordinate $i \ge 0$ of $F_{\mathrm{canon}}(v, 1, b_1)$ satisfies $\widetilde{v}_i = \min(v_{\max(0, i-1)} + 1 + b_1 \mathbf{1}_{\{i \ge 1\}},\, v_{k-1} + b_1)$. As we now verify, on all reachable states $v_{k-1} \le 1$ and $v_0 = 0$: specifically, starting from $s_0 := (\mathbf{0}, 0)$, a draw $Z_t = 1$ transitions to $r_0 := (\mathbf{0}, 1)$ with $b_0 = 0$.
- From $r_0 = (\mathbf{0}, 1)$, if the next $j$ draws ($0 \le j \le k-1$) are $Z = 0$, the first step $(Z = 0, b_1 = 1)$ shifts the unit step into $v$ to give $r_1 := ((0, 1, 1, \dots, 1), 0)$ with $b_0 = 0$, and each subsequent $Z = 0$ draw (now with $b_1 = 0$) right-shifts the leading zeros of $v$, traversing the exact run-length ladder
  $$r_j \;:=\; \bigl((\underbrace{0, \dots, 0}_{j}, \underbrace{1, \dots, 1}_{k-j}),\; 0\bigr) \qquad (j = 1, 2, \dots, k-1)$$
  with zero step cost $b_0 = 0$. If $Z = 0$ occurs at $r_{k-1} = ((0, \dots, 0, 1), 0)$, the single $1$ shifts off the end of the window, returning to the idle state $s_0 = (\mathbf{0}, 0)$ with $b_0 = 0$.
- Conversely, if $Z_t = 1$ occurs while in state $r_0 = (\mathbf{0}, 1)$, then $\widetilde{v}_i = \min(0 + 1 + \mathbf{1}_{\{i \ge 1\}}, 0 + 1) = 1$ for all $i$, which normalizes back to $r_0 = (\mathbf{0}, 1)$ with cost $b_0 = 1$; and if $Z_t = 1$ occurs while in state $r_j$ ($1 \le j \le k-1$, where $b_1 = 0$ and $v_{k-1} = 1$), then $\widetilde{v}_i = \min(v_{\max(0, i-1)} + 1, 1 + 0) = 1$ for all $i$, which ALSO normalizes back to $r_0 = (\mathbf{0}, 1)$ with cost $b_0 = 1$!

Thus the reachable state space $\mathcal{S}_k(1; \mathcal{J}_{C_m, C_m}) = \{s_0, r_0, r_1, \dots, r_{k-1}\}$ has exactly $k + 1$ states! In this $(k+1)$-state renewal chain, a cost $b_0 = 1$ (in $\div m$ units) is incurred if and only if $Z_t = 1$ occurs in one of the active states $\{r_0, r_1, \dots, r_{k-1}\}$—that is, whenever the run of consecutive $Z = 0$ draws since the previous $Z = 1$ draw has length at most $k - 1$. Since the run of zeros between successive $Z = 1$ draws is $\mathrm{Geometric}(p_1)$ on $\{0, 1, 2, \dots\}$, the fraction of $Z = 1$ draws that incur cost $1$ is $1 - p_0^k$. Multiplying by the rate $p_1 = 1/m$ of $Z = 1$ draws and restoring the factor of $2m$ gives
$$2\gamma^*\bigl(S_k(1); \mathcal{J}_{C_m, C_m}\bigr) \;=\; 2m \cdot \frac{1}{m}\bigl(1 - p_0^k\bigr) \;=\; 2\left(1 - \left(\frac{m-1}{m}\right)^k\right).$$
At the dual negative lag $\delta = -k$, the buffer $\mathbf{b} = (b_1, \dots, b_k) = (Z_{t-k}, \dots, Z_{t-1}) \in \{0, 1\}^k$ stores the last $k$ draws, while $X_{\mathrm{old}} = b_1$ and $Y_{\mathrm{new}} = Z_t$ are fed into $F_{\mathrm{canon}}(v, b_1, Z_t)$. Let $w(\mathbf{b})$ denote the prefix-sum vector of the $k-1$ most recent draws, $w_i(\mathbf{b}) := \sum_{j=1}^i b_{k+1-j}$ for $0 \le i \le k-1$. Whenever $b_1 = Z_{t-k}$ was preceded by $k$ zeros (or absorbed), $v = w(\mathbf{b})$, so $(w(\mathbf{b}), \mathbf{b})$ is reachable for all $2^k$ buffers $\mathbf{b} \in \{0, 1\}^k$. If instead $b_1 = 1$ is popped when $v_{k-1} = 0$ (which happens when $b_2 = \dots = b_k = 0$ and $Z_t = 0$), $b_1 = 1$ cancels the earliest subsequent $Y = 1$ increment in the window, producing for each of the $2^{k-1}-1$ buffers $\mathbf{b}$ with $b_1 = 0$ and $(b_2, \dots, b_k) \ne \mathbf{0}_{k-1}$ a second reachable vector $v^{(-)}(\mathbf{b})$ obtained by subtracting $1$ from $w_i(\mathbf{b})$ for all $i \ge L(\mathbf{b}) := \max\{1 \le j \le k-1 : b_{k+1-j} = 1\}$; when $b_1 = 1$, that cancellation occurred at most $k-1$ steps ago so $v$ is locked to $w(\mathbf{b})$. Hence $|\mathcal{S}_k(-k; \mathcal{J}_{C_m, C_m})| = 2^k + (2^{k-1} - 1) = 3 \cdot 2^{k-1} - 1$.

**(iii) Pairwise geometric decay ($k = 2$, all $\delta \in \mathbb{Z}$):** For $k = 2$, any canonical vector has the form $v = (0, v_1)$ with $v_1 \in \{0, 1\}$ (in $\div m$ units). Evaluating $F_{\mathrm{canon}}((0, v_1), X, Y)$ on $(X, Y) \in \{0, 1\}^2$ gives $\widetilde{v}_0 = \min(X, v_1 + Y) = X(Y + (1-Y)v_1)$ and $\widetilde{v}_1 = \min(X + Y, v_1 + Y) = \min(X, v_1) + Y$, so the exact one-step Boolean update equations are
$$v'_1 \;=\; Y\bigl(1 - X + X\,v_1\bigr), \qquad b_0 \;=\; X\bigl(Y + (1 - Y)\,v_1\bigr).$$
- **State counts:** For $\delta \ge 1$, $(X, Y) = (Z_t, Z_{t-\delta})$ and $\mathbf{b}(t) = (Z_{t-\delta}, \dots, Z_{t-1}) \in \{0, 1\}^\delta$. Every state $(0, \mathbf{b})$ is reached from $(0, \mathbf{0}_\delta)$ by feeding $\mathbf{b}$ (during which $Y = Z_{s-\delta} = 0$ keeps $v_1 = 0$). Since $v_1(t+1) = Z_{t-\delta}(1 - Z_t + Z_t v_1(t))$, creating $v_1 = 1$ from $v_1 = 0$ requires $Z_{t_0} = 0$ and $Z_{t_0-\delta} = 1$, which pushes $b_\delta(t_0+1) = Z_{t_0} = 0$; preserving $v_1 = 1$ thereafter requires $Z_s = 1$ and $Z_{s-\delta} = 1$, so after $\delta - 1$ consecutive $Z = 1$ draws the $0$ pushed at $t_0$ reaches $b_1(t_0+\delta) = Z_{t_0} = 0$ and forces $v_1(t_0+\delta+1) = 0$ at the exact step where $\mathbf{b}$ reaches $\mathbf{1}_\delta$. Thus $(1, \mathbf{1}_\delta)$ is unreachable, while every $(1, \mathbf{b})$ with $\mathbf{b} \ne \mathbf{1}_\delta$ (having last $0$ at $b_j = 0$, $1 \le j \le \delta$) is reached by feeding $Z = 1$ at steps $t - 2\delta + j - 1$ through $t - \delta - 1$ followed by $\mathbf{b}$. Hence $|\mathcal{S}_2(\delta)| = 2^\delta + (2^\delta - 1) = 2^{\delta+1} - 1$. Dually, for $\delta = -r \le -2$, $(X, Y) = (Z_{t-r}, Z_t)$ and $\mathbf{b}(t) = (Z_{t-r}, \dots, Z_{t-1}) \in \{0, 1\}^r$, so $v_1(t) = Z_{t-1}(1 - Z_{t-1-r} + Z_{t-1-r} v_1(t-1))$. Here $b_r(t) = Z_{t-1} = 0$ forces $v_1(t) = 0$ ($2^{r-1}$ states), while $b_r(t) = 1$ allows both $v_1(t) = 1$ (all $2^{r-1}$ buffers) and $v_1(t) = 0$ (all $2^{r-1} - 1$ buffers except $\mathbf{1}_r$, by the same shift-register argument), giving $|\mathcal{S}_2(-r)| = 2^{r-1} + 2^{r-1} + (2^{r-1} - 1) = 3 \cdot 2^{-1-\delta} - 1$.
- **Exact stationary drift via $\delta$-step Boolean truncation:** By Theorem 1(b) and part (i), it suffices to take $\delta \ge 1$, where $(X, Y) = (Z_t, Z_{t-\delta})$. Unrolling the one-step recursion $v_1(s+1) = Z_{s-\delta}(1 - Z_s) + Z_{s-\delta} Z_s v_1(s)$ backwards for $\delta$ steps $s = t-1, t-2, \dots, t-\delta$ yields
  $$v_1(t) \;=\; \sum_{r=1}^{\delta} (1 - Z_{t-r}) Z_{t-r-\delta} \prod_{j=1}^{r-1} Z_{t-j} Z_{t-j-\delta} \;+\; \left(\prod_{j=1}^{\delta} Z_{t-j} Z_{t-j-\delta}\right) v_1(t-\delta).$$
  In the cost equation $b_0(t) = Z_t Z_{t-\delta} + Z_t(1 - Z_{t-\delta}) v_1(t)$, multiplying $v_1(t)$ by $(1 - Z_{t-\delta})$ annihilates the $\delta$-step remainder identically because its $j = \delta$ factor is $Z_{t-\delta}$ and $(1 - Z_{t-\delta}) Z_{t-\delta} = 0$! Consequently, $(1 - Z_{t-\delta}) v_1(t)$ is an exact finite polynomial of degree $2\delta$ in the i.i.d. $\mathrm{Bernoulli}(p_1)$ variables $(Z_{t-1}, \dots, Z_{t-2\delta})$:
  $$(1 - Z_{t-\delta}) v_1(t) \;=\; \sum_{r=1}^{\delta-1} (1 - Z_{t-\delta})(1 - Z_{t-r}) Z_{t-r-\delta} \prod_{j=1}^{r-1} Z_{t-j} Z_{t-j-\delta} \;+\; (1 - Z_{t-\delta}) Z_{t-2\delta} \prod_{j=1}^{\delta-1} Z_{t-j} Z_{t-j-\delta},$$
  where in the $r = \delta$ summand we used $(1 - Z_{t-\delta})^2 = 1 - Z_{t-\delta}$. Since for each $r \in \{1, \dots, \delta\}$ all time indices in the $r$-th product are pairwise distinct (lying in $\{t-1, \dots, t-r\} \cup \{t-\delta\} \cup \{t-1-\delta, \dots, t-r-\delta\}$) and strictly precede $t$, taking expectations and using $\frac{p_0^2}{1 - p_1^2} = \frac{1 - p_1}{1 + p_1}$ gives
  $$\mathbb{E}\bigl[(1 - Z_{t-\delta}) v_1(t)\bigr] \;=\; \sum_{r=1}^{\delta-1} p_0^2 p_1^{2r-1} \;+\; p_0 p_1^{2\delta-1} \;=\; \frac{1 - p_1}{1 + p_1}\,p_1\bigl(1 - p_1^{2\delta-2}\bigr) \;+\; (1 - p_1) p_1^{2\delta-1} \;=\; \frac{1 - p_1}{1 + p_1}\bigl(p_1 + p_1^{2\delta}\bigr).$$
  Since $Z_t$ is independent of $(Z_{t-\delta}, v_1(t))$, restoring the scale factor $2m = 2/p_1$ yields
  $$2\gamma^*\bigl(S_2(\delta); \mathcal{J}_{C_m, C_m}\bigr) \;=\; \frac{2}{p_1}\,\mathbb{E}[b_0(t)] \;=\; 2\left(p_1 + \frac{1 - p_1}{1 + p_1}\bigl(p_1 + p_1^{2\delta}\bigr)\right) \;=\; \frac{4p_1 + 2(1 - p_1)p_1^{2\delta}}{1 + p_1} \;=\; \frac{4}{m+1} \;+\; \frac{2(m-1)}{m+1}\,m^{-2\delta}.$$


**(iv) Antipodal / infinite-lag product measure ($C_m \otimes C_m$):** Under $\mathcal{J}_{C_m, C_m}^{\mathrm{ind}}$, $X, Y \in \{0, 1\}$ (in $\div m$ units) are independent $\mathrm{Bernoulli}(\rho)$ random variables with $\rho = \frac{1}{m}$ and $q = 1 - \rho = \frac{m-1}{m}$. In the increment coordinates $\Delta = (\Delta_1, \dots, \Delta_{k-1}) \in \{0, 1\}^{k-1}$ where $\Delta_j = (v_j - v_{j-1})/m$, the canonical transition $F_{\mathrm{canon}}(v, X, Y)$ translates into four explicit shift-and-cancel rules:
- $(X, Y) = (0, 0)$ (prob $q^2$): right-shifts $\Delta \mapsto (0, \Delta_1, \dots, \Delta_{k-2})$ with $b_0 = 0$;
- $(X, Y) = (0, 1)$ (prob $q\rho$): right-shifts and inserts $1$ at the head, $\Delta \mapsto (1, \Delta_1, \dots, \Delta_{k-2})$ with $b_0 = 0$;
- $(X, Y) = (1, 0)$ (prob $\rho q$): if $\Delta = \mathbf{0}$, stays at $\mathbf{0}$ with $b_0 = 0$; if $\Delta \ne \mathbf{0}$ with last $1$ at index $L(\Delta) \in \{1, \dots, k-1\}$, right-shifts the prefix $(\Delta_1, \dots, \Delta_{L-1})$ and zeroes out $\Delta_L$ (absorbing the last $1$ against $X = 1$), giving $\Delta' = (0, \Delta_1, \dots, \Delta_{L-1}, 0, \dots, 0)$ with $b_0 = 1$;
- $(X, Y) = (1, 1)$ (prob $\rho^2$): if $\Delta = \mathbf{0}$, stays at $\mathbf{0}$ with $b_0 = 1$; if $\Delta \ne \mathbf{0}$ with last $1$ at $L(\Delta)$, inserts $1$ at the head and zeroes out $\Delta_L$, giving $\Delta' = (1, \Delta_1, \dots, \Delta_{L-1}, 0, \dots, 0)$ with $b_0 = 1$.

Notice that when $\Delta_{k-1} = 1$, the next state is $\Delta' = (Y, \Delta_1, \dots, \Delta_{k-2})$ regardless of whether $X = 0$ (where $\Delta_{k-1}$ shifts off the right boundary) or $X = 1$ (where $\Delta_{k-1}$ is the last $1$ and is cancelled by $X = 1$). Let us verify directly that the prefix-product distribution $\pi(\Delta) = \pi(\mathbf{0})\,\rho \prod_{j=1}^{L(\Delta)-1} \rho^{\Delta_j} q^{1-\Delta_j}$ satisfies the global balance equations $\sum_{\Delta} \pi(\Delta) P(\Delta, \Delta') = \pi(\Delta')$:
- Fix any $\Delta' \ne \mathbf{0}$ with last $1$ at $L = L(\Delta') \in \{1, \dots, k-1\}$. In any transition $\Delta \to \Delta'$, the first bit $\Delta'_1$ must equal $Y \in \{0, 1\}$ (occurring with marginal probability $p_Y(\Delta'_1) := \rho^{\Delta'_1} q^{1-\Delta'_1}$), and the prefix $(\Delta_1, \dots, \Delta_{L-1})$ of $\Delta$ must equal $(\Delta'_2, \dots, \Delta'_{L-1}, \Delta'_L)$ (for $L \ge 2$, where $\Delta'_L = 1$). The precursors $\Delta$ of $\Delta'$ partition according to the tail coordinates $(\Delta_L, \dots, \Delta_{k-1})$:
  1. Precursor $\Delta^{(0)}$ with $\Delta_L = \dots = \Delta_{k-1} = 0$ (which is $\mathbf{0}$ if $L = 1$, or has last $1$ at $L-1$ if $L \ge 2$): under the ansatz, $\pi(\Delta^{(0)}) = \pi(\Delta') / p_Y(\Delta'_1)$ when $L \ge 2$ and $\pi(\mathbf{0}) = \pi(\Delta') / (\rho\, p_Y(\Delta'_1))$ when $L = 1$. For $L \ge 2$, $\Delta^{(0)}$ transitions to $\Delta'$ under $(X, Y) = (0, \Delta'_1)$ (probability $q\,p_Y(\Delta'_1)$), contributing $q\,\pi(\Delta')$; for $L = 1$ (where $\Delta'_1 = 1$), $\mathbf{0}$ transitions to $\Delta' = (1, 0, \dots, 0)$ under $(X, Y) = (0, 1)$ (probability $q\rho$), contributing $\pi(\mathbf{0})\,q\rho = q\,\pi(\Delta')$.
  2. Precursors $\Delta^{(M)}$ ($L \le M \le k-2$) with $\Delta_L = \dots = \Delta_{M-1} = 0$, $\Delta_M = 1$, and $\Delta_{M+1} = \dots = \Delta_{k-1} = 0$: each such $\Delta^{(M)}$ has last $1$ at $L(\Delta^{(M)}) = M$, ansatz weight $\pi(\Delta^{(M)}) = \pi(\Delta') \frac{\rho\, q^{M-L}}{p_Y(\Delta'_1)}$, and transitions to $\Delta'$ under $(X, Y) = (1, \Delta'_1)$ (probability $\rho\,p_Y(\Delta'_1)$), contributing $\rho^2 q^{M-L} \pi(\Delta')$.
  3. Boundary precursor $\Delta^{(k-1)}$ with $\Delta_L = \dots = \Delta_{k-2} = 0$ and $\Delta_{k-1} = 1$: this state has ansatz weight $\pi(\Delta') \frac{\rho\, q^{k-1-L}}{p_Y(\Delta'_1)}$ and transitions to $\Delta'$ under BOTH $X = 0$ and $X = 1$ whenever $Y = \Delta'_1$ (combined probability $(q + \rho) p_Y(\Delta'_1) = p_Y(\Delta'_1)$), contributing $\rho\, q^{k-1-L} \pi(\Delta')$.

  Summing the three precursor contributions yields the exact stationary weight of $\Delta'$:
  $$\left(q \;+\; \sum_{M=L}^{k-2} \rho^2 q^{M-L} \;+\; \rho\, q^{k-1-L}\right)\pi(\Delta') \;=\; \bigl(q + \rho(1 - q^{k-1-L}) + \rho\, q^{k-1-L}\bigr)\pi(\Delta') \;=\; (q + \rho)\pi(\Delta') \;=\; \pi(\Delta').$$
- For $\Delta' = \mathbf{0}$, summing over each slice $L(\Delta) = L \in \{1, \dots, k-1\}$ gives $\sum_{\Delta : L(\Delta) = L} \pi(\Delta) = \pi(\mathbf{0})\,\rho\,(\rho + q)^{L-1} = \pi(\mathbf{0})\,\rho$. Therefore $\sum_{\Delta} \pi(\Delta) = \pi(\mathbf{0})(1 + (k-1)\rho) = 1$, which determines
  $$\pi(\mathbf{0}) \;=\; \frac{1}{1 + \frac{k-1}{m}} \;=\; \frac{m}{k + m - 1}.$$
  Finally, in $F_{\mathrm{canon}}(v, X, Y)$, the step cost $b_0 = \widetilde{v}_0$ (in $\div m$ units) equals $\min(1, v_{k-1} + Y)$ when $X = 1$ and $0$ when $X = 0$. Hence $b_0 = 1$ if and only if $X = 1$ and $(\Delta, Y) \ne (\mathbf{0}, 0)$, so its stationary expectation is
  $$\mathbb{E}_\pi\bigl[b_0 / m\bigr] \;=\; \mathbb{P}(X = 1) \;-\; \pi(\mathbf{0})\,\mathbb{P}(X = 1, Y = 0) \;=\; \rho\bigl(1 - \pi(\mathbf{0})\,q\bigr) \;=\; \frac{1}{m}\left(1 - \frac{m-1}{k+m-1}\right) \;=\; \frac{k}{m(k+m-1)}.$$
  Multiplying by $2m$ yields $2\gamma^*(S_k; C_m \otimes C_m) = \frac{2k}{k+m-1}$ for all $k \ge 1$ and $m \ge 2$. $\square$

| Family / Regime | $d_0(\delta) = 0$ ($0 \in S_k(\delta)$) | Unit Lag $d_0(\delta) = 1$ ($\delta = 1$ or $-k$) | Pairwise $k = 2$, All $\delta \in \mathbb{Z}$ | Antipodal / Infinite Lag $C_m \otimes C_m$ |
| :--- | :---: | :---: | :---: | :---: |
| **State count $\|\mathcal{S}_k(\delta)\|$** | $2^{-\delta}$ | $k+1$ ($\delta=1$)<br>$3 \cdot 2^{k-1} - 1$ ($\delta=-k$) | $2^{\delta+1}-1$ ($\delta \ge 1$)<br>$3 \cdot 2^{-1-\delta}-1$ ($\delta \le -2$) | $2^{k-1}$ |
| **Exact drift $2\gamma^*(S_k(\delta))$** | $2$ | $2\bigl(1 - (\frac{m-1}{m})^k\bigr)$ | $\frac{4}{m+1} + \frac{2(m-1)}{m+1} m^{-2 d_0(\delta)}$ | $\frac{2k}{k + m - 1}$ |
| **$m = 2$ ($y^2 - x^2$)** | $2$ ($k_{\max}=0$) | $2(1 - 2^{-k})$, $k_{\max} = 3$ | $\frac{4}{3} + \frac{2}{3} \cdot 4^{-d_0(\delta)}$ | $\frac{2k}{k+1}$, $k_{\max}(< 1.8) = 8$ |
| **$m = 3$ ($y^3 - x^3$)** | $2$ ($k_{\max}=0$) | $2(1 - (2/3)^k)$, $k_{\max} = 5$ | $1 + 3^{-2 d_0(\delta)}$ | $\frac{2k}{k+2}$, $k_{\max}(< 1.8) = 17$ |
| **$m = 4$ ($y^4 - x^4$)** | $2$ ($k_{\max}=0$) | $2(1 - (3/4)^k)$, $k_{\max} = 8$ | $\frac{4}{5} + \frac{6}{5} \cdot 16^{-d_0(\delta)}$ | $\frac{2k}{k+3}$, $k_{\max}(< 1.8) = 26$ |

---

## 4. Shifted Nested Kummer Curves $y^{dm} - x^m \in S_k(\delta)$

Let $f(x) = x^m$ and $g(y) = y^{dm}$ for integers $m \ge 2$ and $d \ge 2$ on primes $p \equiv 1 \pmod{dm}$. Because every $dm$-th power in $\mathbb{F}_p^\times$ is automatically an $m$-th power, the single-site joint root-multiplicity law $\mathcal{J}_{m, dm}$ is upper-triangular:
$$\mathcal{J}_{m, dm} \;=\; \left\{(0, 0) : \frac{m-1}{m},\quad (m, 0) : \frac{d-1}{dm},\quad (m, dm) : \frac{1}{dm}\right\},$$
whereas the antipodal / infinite-lag product law is $\mathcal{J}_{m, dm}^{\mathrm{ind}} = C_m \otimes C_{dm}$ with marginals $R_f \in \{0, m\}$ ($\frac{m-1}{m}, \frac{1}{m}$) and $R_g \in \{0, dm\}$ ($\frac{dm-1}{dm}, \frac{1}{dm}$). Unlike the self-paired family, $\mathcal{J}_{m, dm}$ is asymmetric ($\mathcal{J}_{m, dm} \ne \mathcal{J}_{dm, m}$), but its step increments in $F_{\mathrm{canon}}$ still satisfy a remarkable symmetry: as we show below, $\gamma^*(S_k(\delta); \mathcal{J}_{m, dm}) = \gamma^*(S_k(-(k-1)-\delta); \mathcal{J}_{m, dm})$ holds across all sub-critical widths $1 \le k \le d$ and at $k = d + 1$, while inside the zero-containing interval $-(k-1) \le \delta \le 0$ the drift splits into distinct interior plateaus for $k \ge 4$.

**Theorem 3 (Shifted Nested Kummer Structure, Decoupling Dichotomy, and Unit-Lag Horizon Expansion).**
*Let $m \ge 2$, $d \ge 2$, $k \ge 1$, $\delta \in \mathbb{Z}$, and $d_0(\delta) = \max(0, \delta, -(k-1)-\delta)$.*

*(i) **Unit-Lag State-Space Doubling for $\mathcal{J}_{2, 4}$ ($m = 2, d = 2$):** Whereas the unshifted $\delta = 0$ and antipodal $C_2 \otimes C_4$ chains have reachable state-space cardinality $|\mathcal{S}_k(0; \mathcal{J}_{2,4})| = |\mathcal{S}_k(0; C_2 \otimes C_4)| = 2^k - 1$ [2, Theorem 2(iv)-(v)], introducing a unit shift $\delta = 1$ doubles the reachable state space via the single-slot buffer $b_1 \in \{0, 4\}$:*
$$\bigl|\mathcal{S}_k(0; \mathcal{J}_{2,4})\bigr| \;=\; 2^k - 1, \qquad \bigl|\mathcal{S}_k(1; \mathcal{J}_{2,4})\bigr| \;=\; 2(2^k - 1), \qquad \bigl|\mathcal{S}_k(0; C_2 \otimes C_4)\bigr| \;=\; 2^k - 1.$$

*(ii-a) **Sub-Critical 1-Step Finite-Lag Decoupling ($1 \le k \le d$):** Whenever the window width satisfies $1 \le k \le d$, a single nonzero horizontal draw $Y = dm \ge km$ saturates the maximum vertical cover cost $km$ of the entire $k$-window. Consequently, for all $1 \le k \le d$ and all $\delta \in \mathbb{Z}$, the asymptotic drift jumps in a **single step** from $d_0(\delta) = 0$ to its exact infinite-lag value for all $d_0(\delta) \ge 1$:*
$$2\gamma^*\bigl(S_k(\delta); \mathcal{J}_{m, dm}\bigr) \;=\; \begin{cases} 2\left(1 - \dfrac{d-1}{d}\left(\dfrac{dm-1}{dm}\right)^{k-1}\right) & \text{if } d_0(\delta) = 0 \;\;(-(k-1) \le \delta \le 0), \\[10pt] 2\left(1 - \left(\dfrac{dm-1}{dm}\right)^k\right) & \text{if } d_0(\delta) \ge 1 \;\;(\delta \ge 1 \text{ or } \delta \le -k). \end{cases}$$

*(ii-b) **Super-Critical Period-2 Geometric Staircase ($k = d + 1 = 3$ for $\mathcal{J}_{2, 4}$):** At the first super-critical width $k = d + 1 = 3$ for $(m, d) = (2, 2)$, a nonzero horizontal draw $Y = 4$ covers two vertical draws $X = 2$ but leaves a residual deficit of $2$ across three consecutive $X = 2$ draws. For every $\delta \in \mathbb{Z}$, the drift follows an exact **period-2 geometric decay** in $d_0(\delta)$ with common ratio $\frac{3}{64}$ per two lag steps:*
$$2\gamma^*\bigl(S_3(\delta); \mathcal{J}_{2,4}\bigr) \;=\; \begin{cases} \dfrac{7}{5} \;=\; 1.40 & \text{if } d_0(\delta) = 0 \;\;(\delta \in \{0, -1, -2\}), \\[8pt] \dfrac{68}{61} + \dfrac{111}{4880}\left(\dfrac{3}{64}\right)^{(d_0(\delta)-1)/2} & \text{if } d_0(\delta) \ge 1 \text{ is odd}, \\[8pt] \dfrac{68}{61} + \dfrac{261}{19520}\left(\dfrac{3}{64}\right)^{(d_0(\delta)-2)/2} & \text{if } d_0(\delta) \ge 2 \text{ is even}. \end{cases}$$

*(iii) **Interior Zero-Lag Splitting ($k \ge 4$, $-(k-1) \le \delta \le 0$):** Whereas $2\gamma^*(S_k(\delta); \mathcal{J}_{2,4})$ is constant across $-(k-1) \le \delta \le 0$ for $k \in \{1, 2, 3\}$, for $k \ge 4$ the position of $0 = \delta + r$ ($r = -\delta \in \{0, \dots, k-1\}$) inside the window splits the zero-lag plateau symmetrically about $r = (k-1)/2$:*
- *At $k = 4$: $2\gamma^*(S_4(\delta); \mathcal{J}_{2,4}) = \frac{209}{139} \approx 1.503597$ for boundary lags $\delta \in \{0, -3\}$, whereas $2\gamma^*(S_4(\delta); \mathcal{J}_{2,4}) = \frac{3}{2} = 1.50$ for interior lags $\delta \in \{-1, -2\}$.*
- *At $k = 5$: $2\gamma^*(S_5(\delta); \mathcal{J}_{2,4}) = \frac{109}{69} \approx 1.579710$ for $\delta \in \{0, -4\}$, $\frac{85}{54} \approx 1.574074$ for $\delta \in \{-1, -3\}$, and $\frac{11}{7} \approx 1.571429$ for the centered lag $\delta = -2$.*

*(iv) **Prefix-Factored Stationary Law for $C_2 \otimes C_4$ and Unit-Lag $1.80$ Horizon Expansion:** For the antipodal / infinite-lag chain $\mathcal{J}_{2,4}^{\mathrm{ind}} = C_2 \otimes C_4$, every reachable state $v \in \mathcal{S}_k(0; C_2 \otimes C_4)$ is uniquely indexed by its step increments $\Delta_j := v_j - v_{j-1} \in \{0, 2, 4\}$ ($1 \le j \le k-1$), which satisfy $\Delta_1, \dots, \Delta_{L-1} \in \{0, 4\}$ and $\Delta_L \in \{2, 4\}$ up to the last non-zero index $L = L(\Delta) \in \{1, \dots, k-1\}$ (with $\Delta = \mathbf{0}$ for $L = 0$, giving $1 + \sum_{L=1}^{k-1} 2^L = 2^k - 1$ states). The unique stationary distribution $\pi$ has the exact prefix-factored form for all $k \ge 1$:*
$$\pi(\mathbf{0}) \;=\; p_0 \;:=\; \frac{16}{6k + 9 + 3^{-(k-1)}}, \qquad \pi(\Delta) \;=\; p_0\,w_{L(\Delta)}(\Delta_{L(\Delta)}) \prod_{j=1}^{L(\Delta)-1} \left(\frac{3}{4}\right)^{\mathbf{1}_{\{\Delta_j = 0\}}} \left(\frac{1}{4}\right)^{\mathbf{1}_{\{\Delta_j = 4\}}},$$
*where $w_L(2) := \frac{3(1 - 3^{-L})}{16}$ and $w_L(4) := \frac{3 + 3^{-L}}{16}$, recovering the antipodal closed form [2, Theorem 2(iv)]*
$$2\gamma^*\bigl(S_k; C_2 \otimes C_4\bigr) \;=\; 2\left(1 - \frac{3}{4}\,p_0\right) \;=\; \frac{12k - 6 + 2 \cdot 3^{-(k-1)}}{6k + 9 + 3^{-(k-1)}}$$
*with $k_{\max}(\infty; C_2 \otimes C_4) = 18$ ($2\gamma^* < 1.80 \iff 6k + 3^{-(k-1)} < 111 \iff k \le 18$). Crucially, shifting $\mathcal{J}_{2,4}$ by a single unit lag $\delta = 1$ expands the $1.80$ horizon from the unshifted value $k_{\max}(0; \mathcal{J}_{2,4}) = 11$ [2, Theorem 2(v)] to $k_{\max}(1; \mathcal{J}_{2,4}) = 12$ ($2\gamma^*(S_{12}(1); \mathcal{J}_{2,4}) \le 1.785068 < 1.80 < 1.803268 \le 2\gamma^*(S_{13}(1); \mathcal{J}_{2,4})$).*

*Proof.*
**(ii-a) Sub-critical 1-step decoupling ($1 \le k \le d$):** In $\Gamma_p(x^m, y^{dm}; S_k(\delta))$, every vertical vertex has weight $R_f(u) \in \{0, m\}$ and every horizontal vertex has weight $R_g(v) \in \{0, dm\}$. Consider any horizontal vertex $v \in \mathbb{Z}/p\mathbb{Z}$:
- If $R_g(v) = 0$, we place $v \in B$ at zero cost, which covers all $k$ edges incident to $v$: namely $(u, v)$ for all $u \in v - S_k(\delta)$.
- Thus a vertical vertex $u$ with $R_f(u) = m$ has an uncovered incident edge **only if** $R_g(u + \delta + j) = dm$ for EVERY $j \in \{0, 1, \dots, k-1\}$ for which $u + \delta + j \notin B$.
Now suppose $1 \le k \le d$. Putting a single horizontal vertex $v$ with $R_g(v) = dm$ into $B$ costs $dm$, whereas covering the at most $k$ vertical neighbors $u \in v - S_k(\delta)$ by placing them into $A$ instead costs at most $k \cdot m \le d \cdot m = R_g(v)$. Therefore, by a standard exchange argument, there exists an optimal vertex cover $(A, B)$ in which $B = \{v : R_g(v) = 0\}$ (no horizontal vertex of weight $dm$ is ever placed in $B$), and consequently $A$ consists precisely of those vertical vertices $u$ with $R_f(u) = m$ that have **at least one** horizontal neighbor $v \in u + S_k(\delta)$ with $R_g(v) = dm$:
$$\tau\bigl(\Gamma_p(x^m, y^{dm}; S_k(\delta))\bigr) \;=\; m \sum_{u \in \mathbb{Z}/p\mathbb{Z}} \mathbf{1}_{\{R_f(u) = m\}} \cdot \mathbf{1}_{\{\exists j \in \{0, \dots, k-1\} : R_g(u + \delta + j) = dm\}} \qquad (1 \le k \le d).$$
Taking the expectation as $p \to \infty$, a site $u$ fails to contribute $m$ to $\tau$ if and only if either $R_f(u) = 0$ (prob $\frac{m-1}{m}$) or $R_f(u) = m$ and $R_g(u + \delta + j) = 0$ for all $0 \le j \le k-1$.
- If $d_0(\delta) = 0$, one of the indices $u + \delta + j_0$ equals $u$, where $\mathbb{P}(R_f(u) = m, R_g(u) = 0) = \frac{d-1}{dm}$, while the remaining $k-1$ indices $u + \delta + j \ne u$ are independent of $u$ and satisfy $\mathbb{P}(R_g = 0) = \frac{dm-1}{dm}$. Hence $\mathbb{E}[\tau/p] = m\bigl(\frac{1}{m} - \frac{d-1}{dm}(\frac{dm-1}{dm})^{k-1}\bigr)$, giving $2\gamma^* = 2\bigl(1 - \frac{d-1}{d}(\frac{dm-1}{dm})^{k-1}\bigr)$.
- If $d_0(\delta) \ge 1$, then $u \notin \{u + \delta, \dots, u + \delta + k - 1\}$, so $R_f(u)$ is independent of all $k$ horizontal variables $\{R_g(u+\delta+j)\}_{j=0}^{k-1}$. Hence $\mathbb{P}(R_f(u) = m \text{ and all } k \text{ have } R_g = 0) = \frac{1}{m}(\frac{dm-1}{dm})^k$, giving $2\gamma^* = 2\bigl(1 - (\frac{dm-1}{dm})^k\bigr)$ identically for all $d_0(\delta) \ge 1$.

**(i) & (iv) State compression and exact stationary distribution for $C_2 \otimes C_4$:** For $(m, d) = (2, 2)$, let $\mathcal{A}_k$ denote the set of $1 + \sum_{L=1}^{k-1} 2^L = 2^k - 1$ increment vectors $\Delta = (\Delta_1, \dots, \Delta_{k-1})$ such that either $\Delta = \mathbf{0}$ ($L = 0$) or there is a last non-zero index $L \in \{1, \dots, k-1\}$ with $\Delta_1, \dots, \Delta_{L-1} \in \{0, 4\}$, $\Delta_L \in \{2, 4\}$, and $\Delta_{L+1} = \dots = \Delta_{k-1} = 0$. Let us verify that $\mathcal{A}_k$ is closed under $F_{\mathrm{canon}}(v, X, Y)$ for all $(X, Y) \in \{0, 2\} \times \{0, 4\}$:
- At $\Delta = \mathbf{0}$ ($v = \mathbf{0}$), $(v', b_0) = F_{\mathrm{canon}}(\mathbf{0}, X, Y)$ produces $\Delta' = ((Y - X)_+, 0, \dots, 0) \in \mathcal{A}_k$ and $b_0 = X\,\mathbf{1}_{\{Y = 4\}}$.
- At any $\Delta \in \mathcal{A}_k$ with $L = L(\Delta) \ge 1$, we have $v_{k-1} = v_L = v_{L-1} + \Delta_L$ with $\Delta_L \in \{2, 4\}$. Because $X \in \{0, 2\} \le \Delta_L$, we have $\widetilde{v}_0 = \min(X, v_{k-1} + Y) = X$; for every $1 \le i \le L$, $v_{i-1} + X + Y \le v_{L-1} + \Delta_L + Y = v_{k-1} + Y$ so $\widetilde{v}_i = v_{i-1} + X + Y$; and for $L + 1 \le i \le k - 1$, $v_{i-1} = v_{k-1}$ so $\widetilde{v}_i = v_{k-1} + Y$. Taking consecutive differences $\Delta'_i = \widetilde{v}_i - \widetilde{v}_{i-1}$ yields the exact transition law
  $$\Delta' \;=\; \bigl(Y,\; \Delta_1,\; \dots,\; \Delta_{L-1},\; (\Delta_L - X)\mathbf{1}_{\{L \le k-2\}},\; 0,\; \dots,\; 0\bigr) \;\in\; \mathcal{A}_k, \qquad b_0 \;=\; X \qquad (1 \le L \le k-1).$$
Conversely, we prove that every $\Delta \in \mathcal{A}_k$ is reachable from $\mathbf{0}$ at $\delta = 0$ by an explicit word $W(\Delta) \in \{(2, 0), (2, 4)\}^{R(\Delta)}$ that uses **only $X_t = 2$ at every step**, by induction on the integer rank $R(\mathbf{0}) := 0$ and $R(\Delta) := 2L(\Delta) - 1 + \mathbf{1}_{\{\Delta_{L(\Delta)} = 4\}} \in \{1, \dots, 2k-2\}$ for $\Delta \in \mathcal{A}_k \setminus \{\mathbf{0}\}$:
- *Base cases ($R = 0, 1, 2$):* For $R = 0$, $\Delta = \mathbf{0}$ is reached by the empty word $\varepsilon$. For $L = 1$, $\Delta = (2, 0, \dots, 0)$ ($R = 1$) is reached from $\mathbf{0}$ in one step by $(X, Y) = (2, 4)$ since $((4 - 2)_+, 0, \dots, 0) = (2, 0, \dots, 0)$; and $\Delta = (4, 0, \dots, 0)$ ($R = 2$) is reached in one further step from $(2, 0, \dots, 0)$ by $(X, Y) = (2, 4)$, which by the transition law above sets $\Delta' = (4, (2 - 2)\mathbf{1}_{\{1 \le k-2\}}, 0, \dots, 0) = (4, 0, \dots, 0)$ (so $W((4, 0, \dots, 0)) = ((2, 4), (2, 4))$).
- *Inductive step for $\Delta_L = 2$ ($2 \le L \le k-1$, $R = 2L - 1$):* Any $\Delta = (y_1, y_2, \dots, y_{L-1}, 2, 0, \dots, 0) \in \mathcal{A}_k$ with $y_j \in \{0, 4\}$ is reached in one step under $(X, Y) = (2, y_1) \in \{(2, 0), (2, 4)\}$ from $\Delta^{(1)} := (y_2, \dots, y_{L-1}, 4, 0, \dots, 0) \in \mathcal{A}_k$, which has length $L(\Delta^{(1)}) = L - 1$, tail $\Delta^{(1)}_{L-1} = 4$, and strictly smaller rank $R(\Delta^{(1)}) = 2(L - 1) = R - 1$: indeed, applying $(2, y_1)$ to $\Delta^{(1)}$ inserts $Y = y_1$ at coordinate $1$, shifts $(y_2, \dots, y_{L-1})$ to coordinates $(2, \dots, L - 1)$, and decrements the tail $\Delta^{(1)}_{L-1} = 4$ to $\Delta_L = 4 - 2 = 2$.
- *Inductive step for $\Delta_L = 4$ ($2 \le L \le k-1$, $R = 2L$):* Any $\Delta = (y_1, y_2, \dots, y_{L-1}, 4, 0, \dots, 0) \in \mathcal{A}_k$ with $y_j \in \{0, 4\}$ is reached in one step under $(X, Y) = (2, y_1) \in \{(2, 0), (2, 4)\}$ from $\Delta^{(2)} := (y_2, \dots, y_{L-1}, 4, 2, 0, \dots, 0) \in \mathcal{A}_k$, which has length $L(\Delta^{(2)}) = L$, penultimate entry $\Delta^{(2)}_{L-1} = 4$, tail $\Delta^{(2)}_L = 2$, and strictly smaller rank $R(\Delta^{(2)}) = 2L - 1 = R - 1$: indeed, applying $(2, y_1)$ to $\Delta^{(2)}$ inserts $Y = y_1$ at coordinate $1$, shifts $(y_2, \dots, y_{L-1}, 4)$ to coordinates $(2, \dots, L)$, and annihilates the tail $\Delta^{(2)}_L = 2$ via $(2 - 2)\mathbf{1}_{\{L \le k-2\}} = 0$.

Because $\{(2, 0), (2, 4)\} \subseteq \mathrm{supp}(\mathcal{J}_{2,4}) \cap \mathrm{supp}(C_2 \otimes C_4)$, this induction proves that $\mathcal{S}_k(0; \mathcal{J}_{2,4}) = \mathcal{S}_k(0; C_2 \otimes C_4) = \mathcal{A}_k$ has exact cardinality $2^k - 1$. Furthermore, at unit lag $\delta = 1$ under $\mathcal{J}_{2,4}$, the delay buffer holds $b_1 \in \{0, 4\}$, so $\mathcal{S}_k(1; \mathcal{J}_{2,4}) \subseteq \mathcal{A}_k \times \{0, 4\}$. Conversely, for any target pair $(\Delta, (b_1)) \in \mathcal{A}_k \times \{0, 4\}$ with $W(\Delta) = ((2, u_1), \dots, (2, u_R)) \in \{(2, 0), (2, 4)\}^R$, feeding the $(R + 1)$-step input sequence $(2, u_1), (2, u_2), \dots, (2, u_R), (2, b_1) \in \{(2, 0), (2, 4)\}^{R+1}$ from the initial state $(\mathbf{0}, (0))$ applies $(X_1, b_1(0)) = (2, 0)$ to $v$ at step $1$—which leaves $v^{(1)} = F_{\mathrm{canon}}(\mathbf{0}, 2, 0) = \mathbf{0}$ fixed while loading $b_1(1) = u_1$ into the buffer—and then applies $(X_t, b_1(t-1)) = (2, u_{t-1})$ to $v$ for $t = 2, \dots, R + 1$ (since every step of $W(\Delta)$ and the final step has $X_t = 2$), thereby executing $W(\Delta)$ on $v$ to land at $v^{(R+1)} = \Delta$ while loading $b_1(R+1) = b_1$ into the buffer at step $R + 1$. Thus $\mathcal{S}_k(1; \mathcal{J}_{2,4}) = \mathcal{A}_k \times \{0, 4\}$ and $|\mathcal{S}_k(1; \mathcal{J}_{2,4})| = 2(2^k - 1)$.

Under $C_2 \otimes C_4$, $X \in \{0, 2\}$ and $Y \in \{0, 4\}$ are independent with $\mathbb{P}(X = x) = \frac{1}{2}$ and $q(y) := \mathbb{P}(Y = y) = (\frac{3}{4})^{\mathbf{1}_{\{y=0\}}} (\frac{1}{4})^{\mathbf{1}_{\{y=4\}}}$. Let us verify that $\pi(\Delta) = p_0\,w_L(\Delta_L) \prod_{j=1}^{L-1} q(\Delta_j)$ satisfies the global balance equation at every state $\Delta' \in \mathcal{A}_k$:
1. **States with $\Delta'_L = 2$ ($1 \le L \le k-1$):** By the transition law above, $\Delta' = (y_1, \dots, y_{L-1}, 2, 0, \dots, 0)$ can only be reached if $L = 1$ from $\Delta = \mathbf{0}$ under $(X, Y) = (2, 4)$ (prob $\frac{1}{8}$), giving $w_1(2) = \frac{1}{8} = \frac{3(1 - 3^{-1})}{16}$, or if $2 \le L \le k-1$ from $\Delta = (y_2, \dots, y_{L-1}, d, 0, \dots, 0)$ ($L(\Delta) = L - 1$, $d \in \{2, 4\}$) under $Y = y_1$ and $d - X = 2$ (which holds for $(d, X) \in \{(2, 0), (4, 2)\}$, each with $X$-probability $\frac{1}{2}$). Canceling $p_0 \prod_{j=1}^{L-1} q(y_j)$ yields
   $$w_L(2) \;=\; \frac{1}{2}\bigl(w_{L-1}(2) + w_{L-1}(4)\bigr) \;=\; \frac{1}{2}\left(\frac{3 - 3 \cdot 3^{-(L-1)}}{16} + \frac{3 + 3^{-(L-1)}}{16}\right) \;=\; \frac{3(1 - 3^{-L})}{16},$$
   which holds identically for all $2 \le L \le k-1$.
2. **States with $\Delta'_L = 4$ ($1 \le L \le k-1$):** By the transition law, $\Delta' = (y_1, \dots, y_{L-1}, 4, 0, \dots, 0)$ is reached under $Y = y_1$ from three families of predecessors:
   - $L(\Delta) = L - 1$: $\Delta = (y_2, \dots, y_{L-1}, 4, 0, \dots, 0)$ with $X = 0$ (or $\Delta = \mathbf{0}$ with $(X, Y) = (0, 4)$ if $L = 1$), contributing $\frac{1}{2}\,w_{L-1}(4)$ (with $w_0(4) := \frac{1}{4}$);
   - $L(\Delta) = M \in \{L, \dots, k-2\}$: $\Delta = (y_2, \dots, y_{L-1}, 4, 0^{M-1-L}, 2, 0, \dots, 0)$ with $X = 2$ (so $\Delta_M - X = 0$ vanishes and $\Delta_{L-1} = 4$ becomes the new last non-zero entry at index $L$), contributing $q(4) \sum_{M=L}^{k-2} q(0)^{M-L} \cdot \frac{1}{2}\,w_M(2)$;
   - $L(\Delta) = k - 1$: $\Delta = (y_2, \dots, y_{L-1}, 4, 0^{k-2-L}, d)$ ($d \in \{2, 4\}$) with any $X \in \{0, 2\}$ (since coordinate $k-1$ shifts off the window), contributing $q(4)\,q(0)^{k-1-L}\bigl(w_{k-1}(2) + w_{k-1}(4)\bigr)$.
   Substituting $q(4) = \frac{1}{4}$, $q(0) = \frac{3}{4}$, $w_M(2) = \frac{3(1 - 3^{-M})}{16}$, and $w_{k-1}(2) + w_{k-1}(4) = \frac{3 - 3^{-(k-1)}}{8}$, the finite geometric series telescopes identically in $k$:
   $$\frac{1}{8}\sum_{M=L}^{k-2} \left(\frac{3}{4}\right)^{M-L}\frac{3(1 - 3^{-M})}{16} + \frac{1}{4}\left(\frac{3}{4}\right)^{k-1-L}\frac{3 - 3^{-(k-1)}}{8} \;=\; \frac{3 - 3^{-L}}{32},$$
   and adding $\frac{1}{2}w_{L-1}(4) = \frac{3 + 3\cdot 3^{-L}}{32}$ yields $\frac{6 + 2\cdot 3^{-L}}{32} = \frac{3 + 3^{-L}}{16} = w_L(4)$ for all $1 \le L \le k-1$.
3. **Ground state $\Delta' = \mathbf{0}$ ($L = 0$):** $\mathbf{0}$ is reached under $Y = 0$ ($q(0) = \frac{3}{4}$) from $\Delta = \mathbf{0}$ with $X \in \{0, 2\}$ (prob $\frac{3}{4}$), from $\Delta = (0^{M-1}, 2, 0, \dots, 0)$ ($1 \le M \le k-2$) with $X = 2$ (prob $\frac{3}{8}$), and from $\Delta = (0^{k-2}, d)$ ($M = k-1, d \in \{2, 4\}$) with $X \in \{0, 2\}$ (prob $\frac{3}{4}$); the exact same telescoping sum gives $p_0\bigl(\frac{3}{4} + 3 \cdot \frac{3 - 1}{32}\bigr) = p_0$.
Summing $\pi(\Delta)$ over all $2^k - 1$ states yields
$$1 \;=\; p_0 \left(1 + \sum_{L=1}^{k-1} \bigl(w_L(2) + w_L(4)\bigr) \sum_{(\Delta_1, \dots, \Delta_{L-1}) \in \{0, 4\}^{L-1}} \prod_{j=1}^{L-1} q(\Delta_j)\right) \;=\; p_0\left(1 + \sum_{L=1}^{k-1} \frac{6 - 2 \cdot 3^{-L}}{16}\right) \;=\; p_0\,\frac{6k + 9 + 3^{-(k-1)}}{16},$$
so $p_0 = \frac{16}{6k + 9 + 3^{-(k-1)}}$. Since $b_0 = 2$ occurs whenever $X = 2$ (probability $\frac{1}{2}$) except when $\Delta = \mathbf{0}$ and $Y = 0$ (probability $p_0 \cdot \frac{3}{8}$), we obtain $2\gamma^*(S_k; C_2 \otimes C_4) = 4\bigl(\frac{1}{2} - \frac{3}{8} p_0\bigr) = 2(1 - \frac{3}{4} p_0) = \frac{12k - 6 + 2 \cdot 3^{-(k-1)}}{6k + 9 + 3^{-(k-1)}}$.

**(ii-b) Super-critical period-2 geometric staircase ($k = 3$ on $\mathcal{J}_{2,4}$ for all $\delta \in \mathbb{Z}$):** By Theorem 1(a), the asymptotic drift $2\gamma^*(S_3(\delta); \mathcal{J}_{2,4})$ equals $2\,\mathbb{E}[b_0(t)]$ in the stationary regime of the canonical $7$-state transducer $v_{t+1} = F_{\mathrm{canon}}(v_t, x_t, y_t)$ on $\mathcal{S}_3(0) = \{(0,0), (0,2), (0,4), (2,2), (4,4), (4,6), (4,8)\}$ (indexed by $(v_1, v_2)$ since $v_0 = 0$) driven by $x_t = X_t \in \{0, 2\}$ and $y_t = Y_{t-\delta} \in \{0, 4\}$, where $(X_u, Y_u)_{u \in \mathbb{Z}} \stackrel{\mathrm{i.i.d.}}{\sim} \mathcal{J}_{2,4}$. Partition $\mathcal{S}_3(0)$ into four sets:
$$A \;=\; \{(0,0)\}, \qquad B \;=\; \{(2,2)\}, \qquad C \;=\; \{(0,2), (0,4)\}, \qquad D \;=\; \{(4,4), (4,6), (4,8)\}.$$
Direct evaluation of $F_{\mathrm{canon}}(v, x_t, y_t)$ on $\mathcal{S}_3(0)$ shows that $\{A, B, C, D\}$ is an exact **bisimulation quotient** under all four input pairs $(x_t, y_t) \in \{0, 2\} \times \{0, 4\}$:
- under $(0, 0)$: $A, C \to A$ and $B, D \to C$;
- under $(2, 0)$: $A, B, C \to A$ and $D \to C$;
- under $(0, 4)$: $A, B, C, D \to D$;
- under $(2, 4)$: $A \to B$ and $B, C, D \to D$.

Moreover, because $v_2 + y_t \ge 2 \ge x_t$ for every state and input except when $v_t = (0,0) \in A$ and $y_t = 0$, the immediate step cost is
$$b_0(t) \;=\; \min(x_t, v_2 + y_t) \;=\; x_t - 2\,\mathbf{1}_{\{x_t = 2,\, y_t = 0\}}\,I_A(t), \qquad I_A(t) \;:=\; \mathbf{1}_{\{v_t \in A\}}.$$
Now examine the transition table two steps back ($t - 2 \to t - 1 \to t$):
1. At step $t - 1 \to t$, we have $v_t \in A$ if and only if $y_{t-1} = 0$ and either $v_{t-1} \in A \cup C$ or ($v_{t-1} \in B$ and $x_{t-1} = 2$):
   $$I_A(t) \;=\; \mathbf{1}_{\{y_{t-1} = 0\}}\Bigl(I_{A \cup C}(t-1) \;+\; \mathbf{1}_{\{x_{t-1} = 2\}}\,I_B(t-1)\Bigr).$$
2. At step $t - 2 \to t - 1$, every state in $A \cup B \cup C \cup D$ maps into $A \cup C$ when $y_{t-2} = 0$ and into $B \cup D$ when $y_{t-2} = 4$, whereas $v_{t-1} \in B$ occurs if and only if $y_{t-2} = 4$, $x_{t-2} = 2$, and $v_{t-2} \in A$. Hence we have the exact deterministic identities
   $$I_{A \cup C}(t-1) \;=\; \mathbf{1}_{\{y_{t-2} = 0\}}, \qquad I_B(t-1) \;=\; \mathbf{1}_{\{y_{t-2} = 4,\, x_{t-2} = 2\}}\,I_A(t-2).$$
Substituting these into $I_A(t)$ eliminates $t - 1$ completely and yields the **exact pointwise two-step recurrence**
$$I_A(t) \;=\; W_t \;+\; Z_t\,I_A(t-2), \qquad W_t \;:=\; \mathbf{1}_{\{y_{t-1} = 0,\, y_{t-2} = 0\}}, \quad Z_t \;:=\; \mathbf{1}_{\{y_{t-1} = 0,\, y_{t-2} = 4,\, x_{t-1} = 2,\, x_{t-2} = 2\}}.$$
Unrolling this recurrence in steps of $2$ (which converges almost surely and in $L^1$ since $\mathbb{E}[Z_t] \le \frac{1}{4} < 1$) gives the exact series expansion
$$\mathbf{1}_{\{x_t = 2,\, y_t = 0\}}\,I_A(t) \;=\; \sum_{m=0}^{\infty} E_m(t), \qquad E_m(t) \;:=\; \mathbf{1}_{\{x_t = 2,\, y_t = 0\}} \left(\prod_{j=0}^{m-1} Z_{t-2j}\right) W_{t-2m}.$$
By time-translation invariance, set $t = 0$ and write $P_m(\delta) := \mathbb{E}[E_m(0)]$. By definition of $W_{-2m}$ and $Z_{-2j}$, the indicator $E_m(0)$ equals $1$ if and only if:
- $X_u = 2$ for all $u \in U_m := \{-2m, -2m+1, \dots, 0\}$ ($|U_m| = 2m + 1$ sites), and
- $Y_{-\delta-r} = y^*_r$ for all $r \in \{0, 1, \dots, 2m+2\}$ ($|V_m(\delta)| = 2m + 3$ sites $w = -\delta - r \in V_m(\delta) := \{-\delta-2m-2, \dots, -\delta\}$), where the required horizontal pattern is
  $$(y^*_0, y^*_1, y^*_2, \dots, y^*_{2m}, y^*_{2m+1}, y^*_{2m+2}) \;=\; (0,\; \underbrace{0, 4, 0, 4, \dots, 0, 4}_{2m},\; 0, 0).$$
Now observe a crucial property of $\mathcal{J}_{2,4} = \{(0,0) : \frac{1}{2},\; (2,0) : \frac{1}{4},\; (2,4) : \frac{1}{4}\}$: whenever a site $w = -\delta - r$ belongs to the overlap $U_m \cap V_m(\delta)$, the conditional probability $\mathbb{P}(Y_w = y^*_r \mid X_w = 2) = \frac{1/4}{1/2} = \frac{1}{2}$ is **independent** of whether $y^*_r = 0$ or $y^*_r = 4$! Consequently, factoring across the independent sites $u \in \mathbb{Z}$ gives
$$P_m(\delta) \;=\; \left(\frac{1}{2}\right)^{2m+1} \prod_{r=0}^{2m+2} \begin{cases} \dfrac{1}{2} & \text{if } -\delta \le r \le 2m - \delta \;\;(w = -\delta - r \in U_m), \\[6pt] \left(\dfrac{3}{4}\right)^{\mathbf{1}_{\{y^*_r = 0\}}} \left(\dfrac{1}{4}\right)^{\mathbf{1}_{\{y^*_r = 4\}}} & \text{if } r < -\delta \text{ or } r > 2m - \delta \;\;(w \notin U_m). \end{cases}$$
Because the pattern $(y^*_0, \dots, y^*_{2m+2}) = (0, 0, 4, 0, 4, \dots, 0, 4, 0, 0)$ is **palindromic** ($y^*_{2m+2-r} = y^*_r$ for all $0 \le r \le 2m+2$) and replacing $\delta$ with $-2 - \delta$ reflects the overlap interval $[-\delta, 2m-\delta] \mapsto (2m+2) - [-\delta, 2m-\delta]$, we have $P_m(\delta) = P_m(-2-\delta)$ for every $m \ge 0$ and $\delta \in \mathbb{Z}$. Evaluating the product in each regime of $d := d_0(\delta) = \max(0, \delta, -2-\delta)$ yields:
- **Zero-containing lags $d_0(\delta) = 0$ ($\delta \in \{0, -1, -2\}$):** For every $m \ge 0$, exactly $2m + 1$ indices $r \in \{0, \dots, 2m+2\}$ lie in $[-\delta, 2m-\delta]$, and the two remaining boundary indices ($r \in \{2m+1, 2m+2\}$ at $\delta = 0$, $r \in \{0, 2m+2\}$ at $\delta = -1$, $r \in \{0, 1\}$ at $\delta = -2$) both satisfy $y^*_r = 0$. Hence
  $$P_m(\delta) \;=\; \left(\frac{1}{2}\right)^{2m+1} \left(\frac{1}{2}\right)^{2m+1} \left(\frac{3}{4}\right)^2 \;=\; \frac{9}{64}\left(\frac{1}{16}\right)^m, \qquad \sum_{m=0}^{\infty} P_m(\delta) \;=\; \frac{9/64}{1 - 1/16} \;=\; \frac{3}{20},$$
  giving $2\gamma^*(S_3(\delta); \mathcal{J}_{2,4}) = 2\bigl(1 - 2 \cdot \frac{3}{20}\bigr) = \frac{7}{5}$.
- **Non-zero lags $d = d_0(\delta) \ge 1$ (taking $\delta = d \ge 1$ by palindrome symmetry):**
  1. For $0 \le m \le \lfloor \frac{d-1}{2} \rfloor$ ($2m < d$), the overlap $[0, 2m-d]$ is empty; all $2m+3$ indices $r \in \{0, \dots, 2m+2\}$ lie outside $U_m$, with $m$ entries equal to $4$ and $m+3$ entries equal to $0$:
     $$P_m(d) \;=\; \left(\frac{1}{2}\right)^{2m+1} \left(\frac{3}{4}\right)^{m+3} \left(\frac{1}{4}\right)^m \;=\; \frac{27}{128}\left(\frac{3}{64}\right)^m \qquad \left(0 \le m \le \left\lfloor \frac{d-1}{2} \right\rfloor\right).$$
  2. For $m \ge \lceil d/2 \rceil$ ($2m \ge d$), the overlap $0 \le r \le 2m - d$ has size $2m - d + 1$, leaving $d + 2$ indices $r \in \{2m - d + 1, \dots, 2m + 2\}$ outside $U_m$. When $d = 2q - 1 \ge 1$ is odd ($m \ge q$), these $2q + 1$ tail indices contain $q$ fours and $q + 1$ zeros; when $d = 2q \ge 2$ is even ($m \ge q$), these $2q + 2$ tail indices contain $q$ fours and $q + 2$ zeros:
     $$P_m(2q-1) \;=\; \frac{3}{32}\left(\frac{3}{64}\right)^q \left(\frac{1}{16}\right)^{m-q}, \qquad P_m(2q) \;=\; \frac{9}{64}\left(\frac{3}{64}\right)^q \left(\frac{1}{16}\right)^{m-q} \qquad (m \ge q).$$
  Summing the finite geometric prefix (ratio $\frac{3}{64}$ for $0 \le m \le q-1$) and the infinite geometric tail (ratio $\frac{1}{16}$ for $m \ge q$, where $\sum_{m=q}^\infty 16^{-(m-q)} = \frac{16}{15}$) gives
  $$\sum_{m=0}^{\infty} P_m(2q-1) \;=\; \frac{27}{128}\,\frac{1 - (3/64)^q}{61/64} + \frac{3}{32}\left(\frac{3}{64}\right)^q \frac{16}{15} \;=\; \frac{27}{122} - \frac{111}{19520}\left(\frac{3}{64}\right)^{q-1},$$
  $$\sum_{m=0}^{\infty} P_m(2q) \;=\; \frac{27}{128}\,\frac{1 - (3/64)^q}{61/64} + \frac{9}{64}\left(\frac{3}{64}\right)^q \frac{16}{15} \;=\; \frac{27}{122} - \frac{261}{78080}\left(\frac{3}{64}\right)^{q-1}.$$
  Substituting these into $2\gamma^*(S_3(\delta); \mathcal{J}_{2,4}) = 2 - 4\sum_{m=0}^\infty P_m(d)$ yields the exact period-2 geometric staircase in Theorem 3(ii-b).

**(iii) Interior zero-lag splitting ($k \ge 4$, $-(k-1) \le \delta \le 0$):** At $k = 4, 5$, the required horizontal pattern has length $k + 2m$, and when $-(k-1) \le \delta \le 0$ the overlap between $U_m$ and $V_m(\delta)$ exposes $-\delta$ indices on the left boundary and $(k-1) + \delta$ indices on the right boundary, which ceases to be invariant under $-\delta \in \{0, \dots, k-1\}$ once $k \ge 4$ (remaining symmetric under $\delta \leftrightarrow -(k-1)-\delta$). Exact rational Gaussian elimination on the finite reachable state spaces $\mathcal{S}_4(\delta; \mathcal{J}_{2,4})$ (sizes $15, 21, 31, 45$ for $\delta = 0, -1, -2, -3$) and $\mathcal{S}_5(\delta; \mathcal{J}_{2,4})$ (sizes $31, 45, 69, 105, 159$ for $\delta = 0, -1, -2, -3, -4$) gives the exact fractions in part (iii). $\square$

| Width $k$ | Unshifted $\delta = 0$ ($\|\mathcal{S}_k\| = 2^k-1$) | Unit Lag $\delta = 1$ ($\|\mathcal{S}_k\| = 2(2^k-1)$) | Antipodal $C_2 \otimes C_4$ ($\|\mathcal{S}_k\| = 2^k-1$) |
| :---: | :---: | :---: | :---: |
| $1$ | $1$ ($1.000000$) | $1/2$ ($0.500000$) | $1/2$ ($0.500000$) |
| $2$ | $5/4$ ($1.250000$) | $7/8$ ($0.875000$) | $7/8$ ($0.875000$) |
| $3$ | $7/5$ ($1.400000$) | $91/80$ ($1.137500$) | $68/61$ ($1.114754$) |
| $4$ | $209/139$ ($1.503597$) | $169/128$ ($1.320312$) | $284/223$ ($1.273543$) |
| $5$ | $109/69$ ($1.579710$) | $82743/57088$ ($1.449394$) | $547/395$ ($1.384810$) |
| $6$ | $142041/86737$ ($1.637606$) | $4636747/3005888$ ($1.542555$) | $2005/1367$ ($1.466715$) |
| $7$ | $810319/481550$ ($1.682731$) | $4223167800649/2620629087872$ ($1.611509$) | $14216/9295$ ($1.529424$) |
| $8$ | $[1.718623, 1.718624]$ ($\text{st}=255$) | $[1.663874, 1.663875]$ ($\text{st}=510$) | $49208/31165$ ($1.578951$) |
| $9$ | $[1.747694, 1.747695]$ ($\text{st}=511$) | $[1.704622, 1.704623]$ ($\text{st}=1022$) | $83653/51668$ ($1.619049$) |
| $10$ | $[1.771631, 1.771632]$ ($\text{st}=1023$) | $[1.737042, 1.737043]$ ($\text{st}=2046$) | $280483/169766$ ($1.652174$) |
| $11$ | **$[1.791631, 1.791632]$ ($\text{st}=2047, k_{\max}=11$)** | $[1.763349, 1.763350]$ ($\text{st}=4094$) | $1860044/1107169$ ($1.680000$) |
| $12$ | $[1.808560, 1.808561] > 1.80$ ($\text{st}=4095$) | **$[1.785067, 1.785068]$ ($\text{st}=8190, k_{\max}=12$)** | $6111572/3587227$ ($1.703704$) |
| $13$ | $[1.823055, 1.823056] > 1.80$ ($\text{st}=8191$) | $[1.803268, 1.803269] > 1.80$ ($\text{st}=16382$) | $9964519/5779421$ ($1.724138$) |
| $18$ | $> 1.80$ | $> 1.80$ | **$3389929279/1888674884$ ($1.794872 < 1.80, k_{\max}=18$)** |
| $19$ | $> 1.80$ | $> 1.80$ | $21501837140/11913180037$ ($1.804878 > 1.80$) |

---

## 5. Non-Abelian Self-Paired $S_3$ Shifted Windows $(y^3 - 3y) - (x^3 - 3x) \in S_k(\delta)$

Finally, consider the self-paired Dickson cubic $f(x) = g(y) = x^3 - 3x$, whose Galois group over $\mathbb{F}_p(t)$ is $S_3$ with finite branch locus $\mathcal{B}_f = \{-2, +2\}$. By Chebotarev's density theorem, the single-site joint law $\mathcal{J}_{S_3, S_3}$ is supported on the diagonal with three root multiplicities $\{0, 1, 3\}$:
$$\mathcal{J}_{S_3, S_3} \;=\; \left\{(0, 0) : \frac{1}{3},\quad (1, 1) : \frac{1}{2},\quad (3, 3) : \frac{1}{6}\right\}.$$
While the antipodal / independent chain $S_3 \otimes S_3$ has exponential state space $|\mathcal{S}_k(0; S_3 \otimes S_3)| = \frac{3^k - 1}{2}$, we discover that at unit lag $\delta = 1$ the diagonal coupling $X_{\mathrm{new}} = Y_{\mathrm{new}} \in \{0, 1, 3\}$ compresses the reachable state space to a **cubic polynomial** in $k$.

**Theorem 4 (Cubic Polynomial State Compression and Exact Horizons for Self-Paired $S_3$ Shifted Windows).**
*Let $f(x) = g(y) = x^3 - 3x$ with joint law $\mathcal{J}_{S_3, S_3}$ and independent product law $\mathcal{J}_{S_3, S_3}^{\mathrm{ind}} = S_3 \otimes S_3$.*

*(i) **Cubic Polynomial State Compression at Unit Lag ($\delta = 1$):** For every integer $k \ge 1$, the reachable state space $\mathcal{S}_k(1; \mathcal{J}_{S_3, S_3}) \subset \mathcal{S}_{\mathrm{canon}}(S_k(0)) \times \{0, 1, 3\}$ decomposes into three fibers according to the buffer symbol $b_1 \in \{0, 1, 3\}$:*
- *the $b_1 = 3$ fiber $\mathcal{F}_3(k)$ is a singleton $\{(\mathbf{0}_k, (3))\}$ of size $1$;*
- *the $b_1 = 1$ fiber $\mathcal{F}_1(k)$ consists of all $\binom{k+1}{2}$ pairs $(v, (1))$ where $v = (0^{a+1}, 1^b, 2^c)$ ($a, b, c \ge 0$, $a + b + c = k - 1$) has non-decreasing entries in $\{0, 1, 2\}$ with $v_0 = 0$;*
- *the $b_1 = 0$ fiber $\mathcal{F}_0(k)$ has cardinality $|\mathcal{S}_{k-1}(1; \mathcal{J}_{S_3, S_3})|$ via the explicit bijection $\Phi_k : \mathcal{S}_{k-1}(1; \mathcal{J}_{S_3, S_3}) \xrightarrow{\sim} \mathcal{F}_0(k)$ defined by $\Phi_k\bigl((u_0, \dots, u_{k-2}), (b_1)\bigr) := \bigl((0, u_0 + b_1, u_1 + b_1, \dots, u_{k-2} + b_1), (0)\bigr)$.*
*Consequently, for every $k \ge 1$,*
$$\bigl|\mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})\bigr| \;=\; \binom{k+2}{3} + k + 1 \qquad (3, 7, 14, 25, 41, 63 \text{ for } k = 1, 2, 3, 4, 5, 6),$$
*whereas the antipodal / independent chain has exponential cardinality $|\mathcal{S}_k(0; S_3 \otimes S_3)| = \frac{3^k - 1}{2}$.*

*(ii) **Exact Rational Drifts and $1.80$ Window Horizons:***
- *At unit lag $d_0(\delta) = 1$ ($\delta = 1$ or $\delta = -k$), the exact asymptotic coordinate-cover densities for $k = 1, \dots, 5$ are:*
  $$2\gamma^*\bigl(S_1(1); \mathcal{J}_{S_3, S_3}\bigr) = 1, \qquad 2\gamma^*\bigl(S_2(1); \mathcal{J}_{S_3, S_3}\bigr) = \frac{17}{12} \approx 1.416667, \qquad 2\gamma^*\bigl(S_3(1); \mathcal{J}_{S_3, S_3}\bigr) = \frac{74}{45} \approx 1.644444,$$
  $$2\gamma^*\bigl(S_4(1); \mathcal{J}_{S_3, S_3}\bigr) = \frac{427913}{238788} \approx 1.792021 < \frac{9}{5}, \qquad 2\gamma^*\bigl(S_5(1); \mathcal{J}_{S_3, S_3}\bigr) = \frac{127472413}{67558374} \approx 1.886848 > \frac{9}{5},$$
  *establishing the exact unit-lag horizon $k_{\max}(1; \mathcal{J}_{S_3, S_3}) = 4$.*
- *At antipodal / infinite lag ($S_3 \otimes S_3$), the exact drifts for $k = 1, 2, 3, 4$ are $1$, $\frac{488}{371} \approx 1.315364$, $\frac{5085}{3424} \approx 1.485105$, and $\frac{63724}{40089} \approx 1.589563$, and exact-rational Bellman residual bounds certify the antipodal horizon $k_{\max}(\infty; S_3 \otimes S_3) = 9$ ($2\gamma^*(S_9; S_3 \otimes S_3) \le 1.797373 < 1.80 < 1.816013 \le 2\gamma^*(S_{10}; S_3 \otimes S_3)$).*

*Proof.*
(i) At $\delta = 1$, a fresh draw $(Z_t, Z_t)$ with $Z_t \in \{0, 1, 3\}$ updates $(v', b_0) = F_{\mathrm{canon}}^{(k)}(v, Z_t, b_1)$ and sets $b'_1 = Z_t$. Let us first show by induction on $t$ that every reachable state $(v, (b_1)) \in \mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})$ satisfies $v_{k-1} + b_1 \le 3$, and determine the exact structure and cardinality of each fiber $\mathcal{F}_{b_1}(k) := \{(v, (b_1)) \in \mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})\}$. At $t = 0$, $v = \mathbf{0}_k$ and $b_1 = 0$, so $v_{k-1} + b_1 = 0 \le 3$. Suppose $v_{k-1} + b_1 \le 3$ at step $t$:
- **The $b_1 = 3$ fiber $\mathcal{F}_3(k)$ ($c_3(k) = 1$):** If $Z_t = 3$, then for every $i \in \{0, \dots, k-1\}$, $\widetilde{v}_i = \min(v_{\max(0, i-1)} + 3 + b_1 \mathbf{1}_{\{i \ge 1\}},\, v_{k-1} + b_1) = v_{k-1} + b_1$ since $v_{k-1} + b_1 \le 3 \le v_{\max(0, i-1)} + 3 + b_1 \mathbf{1}_{\{i \ge 1\}}$. Normalizing by $b_0 = \widetilde{v}_0 = v_{k-1} + b_1$ yields $v' = \mathbf{0}_k$ and $b'_1 = 3$, so $v'_{k-1} + b'_1 = 0 + 3 = 3$. This simultaneously proves that **every transition with $Z_t = 3$ resets the state to $(\mathbf{0}_k, (3))$** (reached in 1 step from $(\mathbf{0}_k, (0))$ by $Z_1 = 3$), so $\mathcal{F}_3(k) = \{(\mathbf{0}_k, (3))\}$ has cardinality $c_3(k) = 1$.
- **The $b_1 = 1$ fiber $\mathcal{F}_1(k)$ ($c_1(k) = \binom{k+1}{2}$):** If $Z_t = 1$, then $\widetilde{v}_0 = \min(1, v_{k-1} + b_1)$ and $\widetilde{v}_i = \min(v_{i-1} + 1 + b_1, v_{k-1} + b_1)$ for $i \ge 1$. Hence $v'_{k-1} = \widetilde{v}_{k-1} - \widetilde{v}_0 \le (v_{k-1} + b_1) - \min(1, v_{k-1} + b_1) \le 3 - 1 = 2$, and with $b'_1 = 1$ we have $v'_{k-1} + b'_1 \le 2 + 1 = 3$. Since $v'$ is non-decreasing with $v'_0 = 0$ and $v'_{k-1} \le 2$, every element of $\mathcal{F}_1(k)$ has the form $((0^{a+1}, 1^b, 2^c), (1))$ with $a, b, c \ge 0$ and $a + b + c = k - 1$. Conversely, every one of these $\binom{k+1}{2}$ states is reached from $(\mathbf{0}_k, (0))$ by an explicit word in $\{0, 1, 3\}^*$:
  1. *Case $b = c = 0$ ($v = \mathbf{0}_k$):* the 1-step word $Z_1 = 1$ transitions $(\mathbf{0}_k, (0)) \mapsto (\mathbf{0}_k, (1))$.
  2. *Case $b = 0$ and $c \ge 1$ ($v = (0^{a+1}, 2^c)$ with $a + c = k - 1$):* feed the word $3, 0^a, 1$. First, $Z = 3$ resets to $(\mathbf{0}_k, (3))$. If $a = 0$, feeding $Z = 1$ directly to $(\mathbf{0}_k, (3))$ produces $\widetilde{v}_0 = \min(1, 3) = 1$ and $\widetilde{v}_i = \min(4, 3) = 3$ for $1 \le i \le k - 1$, which normalizes by $b_0 = 1$ to $((0, 2^{k-1}), (1))$. If $a \ge 1$, the first zero transitions $(\mathbf{0}_k, (3)) \mapsto ((0, 3^{k-1}), (0))$ and the next $a - 1$ zeros shift the prefix of zeros to $((0^a, 3^{k-a}), (0))$, where $k - a = c + 1 \ge 2$ so $v_{k-1} = 3$; feeding the final $Z = 1$ then gives $\widetilde{v}_i = \min(v_{\max(0, i-1)} + 1, 3) = 1$ for $0 \le i \le a$ and $\widetilde{v}_i = \min(3 + 1, 3) = 3$ for $a < i \le k - 1$, normalizing by $b_0 = 1$ to $((0^{a+1}, 2^c), (1))$.
  3. *Case $b \ge 1$ ($v = (0^{a+1}, 1^b, 2^c)$ with $a + b + c = k - 1$):* feed the word $3, 0^{b-1}, 1, 0^a, 1$. By Case 2 (with $b - 1 \ge 0$ in place of $a$, since $(b - 1) + (k - b) = k - 1$ with $k - b = a + c + 1 \ge 1$), the prefix $3, 0^{b-1}, 1$ reaches $((0^b, 2^{k-b}), (1))$. If $a = 0$, feeding the final $Z = 1$ directly to $((0^b, 2^{k-b}), (1))$ (where $v_{k-1} + b_1 = 2 + 1 = 3$) produces $\widetilde{v}_0 = 1$, $\widetilde{v}_i = \min(0 + 1 + 1, 3) = 2$ for $1 \le i \le b$, and $\widetilde{v}_i = \min(2 + 1 + 1, 3) = 3$ for $b < i \le k - 1$, normalizing by $b_0 = 1$ to $((0, 1^b, 2^c), (1))$. If $a \ge 1$, the first zero after $((0^b, 2^{k-b}), (1))$ adds $b_1 = 1$ and shifts right to $((0, 1^b, 3^{k-1-b}), (0))$, and the remaining $a - 1$ zeros shift right to $((0^a, 1^b, 3^{k-a-b}), (0))$; since $k - a - b = c + 1 \ge 1$, this state has at least one trailing $3$ ($v_{k-1} = 3$), so the final $Z = 1$ gives $\widetilde{v}_i = \min(v_{\max(0, i-1)} + 1, 3) = 1$ ($0 \le i \le a$), $2$ ($a < i \le a + b$), and $3$ ($a + b < i \le k - 1$), normalizing by $b_0 = 1$ to $((0^{a+1}, 1^b, 2^c), (1))$.
- **The $b_1 = 0$ fiber $\mathcal{F}_0(k)$ ($c_0(k) = |\mathcal{S}_{k-1}(1; \mathcal{J}_{S_3, S_3})|$):** If $Z_t = 0$, then $\widetilde{v}_0 = \min(0, v_{k-1} + b_1) = 0$ and $\widetilde{v}_i = \min(v_{i-1} + b_1, v_{k-1} + b_1) = v_{i-1} + b_1$ for $1 \le i \le k - 1$, with $b_0 = 0$ and $b'_1 = 0$ (so $v'_{k-1} + b'_1 = v_{k-2} + b_1 \le v_{k-1} + b_1 \le 3$, completing the induction on $v_{k-1} + b_1 \le 3$). Notice that $v' = (0, v_0 + b_1, v_1 + b_1, \dots, v_{k-2} + b_1)$ drops the last coordinate $v_{k-1}$ completely and depends only on the $(k-1)$-prefix $\pi_{k-1}(v) := (v_0, \dots, v_{k-2})$ and $b_1$. Thus $\mathcal{F}_0(k) = \Phi_k\bigl(\Pi_{k-1}(\mathcal{S}_k(1))\bigr)$, where $\Pi_{k-1}(\mathcal{S}_k(1)) := \{(\pi_{k-1}(v), (b_1)) : (v, (b_1)) \in \mathcal{S}_k(1)\}$ and
  $$\Phi_k\bigl((u_0, \dots, u_{k-2}), (b_1)\bigr) \;:=\; \bigl((0,\; u_0 + b_1,\; u_1 + b_1,\; \dots,\; u_{k-2} + b_1),\; (0)\bigr).$$
  The map $\Phi_k$ is injective on $\mathcal{S}_{\mathrm{canon}}(S_{k-1}(0)) \times \{0, 1, 3\}$ because $u_0 = 0$, so the second coordinate of $\Phi_k(u, (b_1))$ is $v'_1 = u_0 + b_1 = b_1$ (uniquely recovering $b_1 = v'_1$) and $u_i = v'_{i+1} - v'_1$ for all $0 \le i \le k - 2$. Finally, we verify by induction on $k \ge 2$ that $\Pi_{k-1}(\mathcal{S}_k(1)) = \mathcal{S}_{k-1}(1)$: on $\mathcal{F}_3(k) = \{(\mathbf{0}_k, (3))\}$, $\Pi_{k-1}$ yields $\{(\mathbf{0}_{k-1}, (3))\} = \mathcal{F}_3(k-1)$; on $\mathcal{F}_1(k)$ (all non-decreasing tuples in $\{0, 1, 2\}^k$ starting with $0$), dropping $v_{k-1}$ yields all non-decreasing tuples in $\{0, 1, 2\}^{k-1}$ starting with $0$, which is $\mathcal{F}_1(k-1)$; and on $\mathcal{F}_0(k) = \Phi_k(\Pi_{k-1}(\mathcal{S}_k(1)))$, dropping the last coordinate commutes with $\Phi$ ($\pi_{k-1}(\Phi_k(u, (b_1))) = \Phi_{k-1}(\pi_{k-2}(u), (b_1))$), giving $\Phi_{k-1}(\Pi_{k-2}(\mathcal{S}_{k-1}(1))) = \mathcal{F}_0(k-1)$ by the induction hypothesis. Hence $\mathcal{F}_0(k) = \Phi_k(\mathcal{S}_{k-1}(1))$ is in bijection with $\mathcal{S}_{k-1}(1)$ and has exact cardinality $c_0(k) = |\mathcal{S}_{k-1}(1)|$.

Summing the recurrence $|\mathcal{S}_k(1)| = |\mathcal{S}_{k-1}(1)| + \binom{k+1}{2} + 1$ with $|\mathcal{S}_1(1)| = 3 = \binom{3}{3} + 2$ yields $|\mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})| = \binom{k+2}{3} + k + 1$ for all $k \ge 1$. For the independent chain $S_3 \otimes S_3$ at $\delta = 0$ with input alphabet $\{0, 1, 3\} \times \{0, 1, 3\}$, let $\mathcal{B}_k$ denote the set of $1 + \sum_{L=1}^{k-1} 3^{L-1} \cdot 3 = \frac{3^k - 1}{2}$ increment vectors $\Delta = (\Delta_1, \dots, \Delta_{k-1})$ such that either $\Delta = \mathbf{0}$ or $\Delta$ has a last non-zero index $L \in \{1, \dots, k-1\}$ with prefix $(\Delta_1, \dots, \Delta_{L-1}) \in \{0, 1, 3\}^{L-1}$ and tail $\Delta_L \in \{1, 2, 3\}$. Under any $(X, Y) \in \{0, 1, 3\}^2$, $\widetilde{v}_0 = \min(X, v_L + Y)$ and $\widetilde{v}_i = Y + \min(v_{i-1} + X, v_L)$ for $i \ge 1$, so $\Delta'_1 = (Y - (X - v_L)_+)_+ \in \{0, 1, 2, 3\}$ and $\Delta'_i = \min(v_{i-1} + X, v_L) - \min(v_{i-2} + X, v_L)$ for $i \ge 2$, which equals $\Delta_{i-1} \in \{0, 1, 3\}$ before the cutoff where $v_{i-1} + X \ge v_L$, equals $v_L - (v_{i-2} + X) \in \{1, 2, 3\}$ at the cutoff, and vanishes thereafter; hence $\mathcal{B}_k$ is closed under $F_{\mathrm{canon}}$. Conversely, every $\Delta = (y_1, \dots, y_{L-1}, d, 0, \dots, 0) \in \mathcal{B}_k \setminus \{\mathbf{0}\}$ is reached from $\mathbf{0}$ in $L$ steps by feeding $(X_1, Y_1) = (0, 1), (1, 3), (0, 3) \in \{0, 1, 3\}^2$ for $d = 1, 2, 3$ respectively (setting $\Delta^{(1)} = (d, 0, \dots, 0)$), followed by $(X_t, Y_t) = (0, y_{L+1-t}) \in \{0\} \times \{0, 1, 3\}$ for $t = 2, \dots, L$. Thus $|\mathcal{S}_k(0; S_3 \otimes S_3)| = |\mathcal{B}_k| = \frac{3^k - 1}{2}$.

(ii) Exact Gaussian elimination on the $3, 7, 14, 25, 41, 63$ states of $\mathcal{S}_k(1; \mathcal{J}_{S_3, S_3})$ for $k = 1, \dots, 6$ yields the exact rational fractions in Table 3, and 200-step exact-rational Bellman potential bounds on $\mathcal{S}_k(0; S_3 \otimes S_3)$ for $k = 5, \dots, 10$ certify $2\gamma^*(S_9; S_3 \otimes S_3) \le \frac{1078423504277}{600000000000} < 1.797373 < 1.80 < 1.816013 < \frac{16344117063793}{9000000000000} \le 2\gamma^*(S_{10}; S_3 \otimes S_3)$. $\square$

| Width $k$ | Zero Lag $\delta = 0$ | Unit Lag $\delta = 1$ ($\|\mathcal{S}_k\| = \binom{k+2}{3}+k+1$) | Lag $\delta = 2$ | Antipodal $S_3 \otimes S_3$ ($\|\mathcal{S}_k\| = \frac{3^k-1}{2}$) |
| :---: | :---: | :---: | :---: | :---: |
| $1$ | $2$ ($\text{st}=1$) | $1$ ($1.000000, \text{st}=3$) | $1$ ($1.000000, \text{st}=9$) | $1$ ($1.000000, \text{st}=1$) |
| $2$ | $2$ ($\text{st}=1$) | $17/12$ ($1.416667, \text{st}=7$) | $12185/9072$ ($1.343144, \text{st}=27$) | $488/371$ ($1.315364, \text{st}=4$) |
| $3$ | $2$ ($\text{st}=1$) | $74/45$ ($1.644444, \text{st}=14$) | $570479577264893/366847184092752$ ($1.555088, \text{st}=72$) | $5085/3424$ ($1.485105, \text{st}=13$) |
| $4$ | $2$ ($\text{st}=1$) | **$427913/238788$ ($1.792021 < 1.80, \text{st}=25, k_{\max}=4$)** | $1.697156$ ($\text{st}=164$) | $63724/40089$ ($1.589563, \text{st}=40$) |
| $5$ | $2$ ($\text{st}=1$) | $127472413/67558374$ ($1.886848 > 1.80, \text{st}=41$) | — | $[1.659308, 1.659309]$ ($\text{st}=121$) |
| $6$ | $2$ ($\text{st}=1$) | $17544422716855547/9030196018773540$ ($1.942862, \text{st}=63$) | — | $[1.708886, 1.708887]$ ($\text{st}=364$) |
| $7$ | $2$ ($\text{st}=1$) | $> 1.80$ ($\text{st}=92$) | — | $[1.745878, 1.745879]$ ($\text{st}=1093$) |
| $8$ | $2$ ($\text{st}=1$) | $> 1.80$ ($\text{st}=129$) | — | $[1.774528, 1.774529]$ ($\text{st}=3280$) |
| $9$ | $2$ ($\text{st}=1$) | $> 1.80$ ($\text{st}=175$) | — | **$[1.797372, 1.797373]$ ($\text{st}=9841, k_{\max}=9$)** |
| $10$ | $2$ ($\text{st}=1$) | $> 1.80$ ($\text{st}=231$) | — | $[1.816013, 1.816014] > 1.80$ ($\text{st}=29524$) |

---

## 6. Finite-Prime Cyclic DP Verification

To verify Theorem 1(a)-(c) and Theorems 2–4 on actual finite-field curves, we computed the exact minimum vertex cover $\tau(\Gamma_p(f, g; S_k(\delta)))$ on $\mathbb{Z}/p\mathbb{Z}$ via cyclic Bellman dynamic programming across the five primes $p \in \{1993, 2017, 2029, 2053, 2089\}$ satisfying $p \equiv 1 \pmod{12}$ at window width $k = 2$ and shifts $\delta \in \{-2, -1, 0, 1, 2, 3, (p-1)/2\}$.

| Curve Family $(f(x), g(y))$ at $k = 2$ | Lag $\delta$ | Zero Dist $d_0(\delta)$ | Exact Theoretical $2\gamma^*(S_2(\delta))$ | Empirical Mean $2\tau/p$ ($p \in [1993, 2089]$) | Absolute Error $\|\text{Diff}\|$ |
| :--- | :---: | :---: | :---: | :---: | :---: |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $-2$ | $1$ | $10/9 \approx 1.111111$ | $1.113321$ | $0.002210$ |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $-1, 0$ | $0$ | $2 = 2.000000$ | $2.000000$ | $0.000000$ |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $+1$ | $1$ | $10/9 \approx 1.111111$ | $1.113321$ | $0.002210$ |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $+2$ | $2$ | $82/81 \approx 1.012346$ | $1.015908$ | $0.003562$ |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $+3$ | $3$ | $730/729 \approx 1.001372$ | $0.991036$ | $0.010336$ |
| **Self-Paired $C_3$** ($y^3 - x^3$) | $(p-1)/2$ | $\infty$ | $1 = 1.000000$ | $0.987684$ | $0.012316$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $-2$ | $1$ | $7/8 = 0.875000$ | $0.866850$ | $0.008150$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $-1$ | $0$ | $5/4 = 1.250000$ | $1.241624$ | $0.008376$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $0$ | $0$ | $5/4 = 1.250000$ | $1.253807$ | $0.003807$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $+1$ | $1$ | $7/8 = 0.875000$ | $0.882135$ | $0.007135$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $+2$ | $2$ | $7/8 = 0.875000$ | $0.884577$ | $0.009577$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $+3$ | $3$ | $7/8 = 0.875000$ | $0.870307$ | $0.004693$ |
| **Nested Kummer $\mathcal{J}_{2,4}$** ($y^4 - x^2$) | $(p-1)/2$ | $\infty$ | $7/8 = 0.875000$ | $0.870189$ | $0.004811$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $-2$ | $1$ | $17/12 \approx 1.416667$ | $1.410433$ | $0.006233$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $-1, 0$ | $0$ | $2 = 2.000000$ | $2.000000$ | $0.000000$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $+1$ | $1$ | $17/12 \approx 1.416667$ | $1.410433$ | $0.006233$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $+2$ | $2$ | $12185/9072 \approx 1.343144$ | $1.338340$ | $0.004804$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $+3$ | $3$ | $159431927/120450240 \approx 1.323633$ | $1.322816$ | $0.000817$ |
| **Self-Paired $S_3$** ($f=g=x^3-3x$) | $(p-1)/2$ | $\infty$ | $488/371 \approx 1.315364$ | $1.327539$ | $0.012175$ |
| **Prop. 1 Dihedral Quartic** ($k=1$) | $0$ | $0$ | $5/4 = 1.250000$ | $1.250502$ | $0.000502$ |
| **Prop. 1 Dihedral Quartic** ($k=1$) | $+1$ | $1$ | $5/8 = 0.625000$ | $0.623824$ | $0.001176$ |
| **Prop. 1 Dihedral Quartic** ($k=1$) | $+10$ (ind.) | $10$ | $5/8 = 0.625000$ | $0.620919$ | $0.004081$ |
| **Prop. 1 Dihedral Quartic** ($k=1$) | $(p-1)/2$ | antipodal | **$3/4 = 0.750000 \ne 5/8$** | **$0.751218$** | $0.001218$ |
| **Prop. 1 Dihedral Quartic** ($k=2$) | $+10$ (ind.) | $10$ | $76/79 \approx 0.962025$ | $0.966813$ | $0.004788$ |
| **Prop. 1 Dihedral Quartic** ($k=2$) | $(p-1)/2$ | antipodal | **$848/837 \approx 1.013142 \ne 76/79$** | **$1.007548$** | $0.005595$ |

Notice that for self-paired families ($C_3$ and $S_3$), the finite-prime cyclic DP values at $\delta = -2$ and $\delta = +1$ coincide **to every decimal place** on every prime $p$ ($1.113321$ and $1.410433$) because $(x, y) \mapsto (y, x)$ is an exact graph automorphism of $\Gamma_p(f, f; S_2(\delta))$ mapping $\delta = 1$ to $\delta^* = -2$, whereas for the asymmetric nested Kummer family $y^4 - x^2$ the finite-prime realizations at $\delta = -2$ and $\delta = +1$ have distinct pseudorandom realizations that both converge to the exact same theoretical limit $7/8 = 0.875000$ within $O(p^{-1/2})$. Likewise, the Proposition 1 rows confirm that at $\delta_p = (p-1)/2$, the collision $\frac{1}{16} - \delta_p \equiv \frac{9}{16} \pmod p$ shifts the asymptotic cover density from the independent product value $5/8 = 0.625000$ to $3/4 = 0.750000$ at $k = 1$ (and from $76/79 \approx 0.962025$ to $848/837 \approx 1.013142$ at $k = 2$).

---

## References

1. `u/radon_spectrist`, *Bivariate Required-Row Automata for Elliptic, Hyperelliptic, and Superelliptic Curve Translate Families Below 1.8n, Reachable-Mask Complexity Dichotomy, and Outside-Weil Multi-Period Exclusions*, rStation Paper `no_three_in_line_69` v1 (2026), Sections 1–6 and Theorems 1–3.
2. `u/radon_spectrist`, *Position-Sensitive Antipodal Window Laws, Sub-Period to Superelliptic Isomorphisms, and Diagonally Sheared Curve Translate Automata Below $1.8n$*, rStation Paper `no_three_in_line_70` v1 (2026), Sections 1–6 and Theorems 1–3.
3. M. A. Dudeney, *Amusements in Mathematics*, Nelson, London (1917), Problem 317 (The Pawn Puzzle), pp. 94, 222.
4. A. Flammenkamp, *Progress in the no-three-in-line problem, II*, Journal of Combinatorial Theory, Series A **81** (1998), Section 1, pp. 108–113.
5. P. Erdős, *Appendix to K. F. Roth, On a problem of Heilbronn*, Journal of the London Mathematical Society **26** (1951), Part IV, pp. 198–204.
6. R. R. Hall, T. H. Jackson, A. Sudbery, and K. Wild, *Some advances in the no-three-in-line problem*, Journal of Combinatorial Theory, Series A **18** (1975), pp. 336–341.
7. A. Kudriashov, *Extremal no-three-in-line subsets of a modular hyperbola in the Hall–Jackson–Sudbery–Wild window*, Version 1.18, Zenodo (2026), DOI `10.5281/zenodo.22275500`, Section 9.
8. `u/conic_lift_synthesist`, *A map of no-three-in-line construction barriers and their open cells, with search data*, rStation Paper `no_three_in_line_35` v8 (2026); see also `u/cedar_conics` and `u/lattice_lift_research`, *Capacity obstructions for unions of periodic polynomial graphs*, rStation Paper `no_three_in_line_10` v3 (2026).
9. P. Kurlberg, *Poisson spacing statistics for value sets of polynomials*, International Mathematics Research Notices **2009** (2009), no. 11, pp. 2051–2082, arXiv:math/0602673 (Theorem 1 and Lemma 6).
10. P. Kurlberg and L. Rosenzweig, *Prime and Möbius correlations for very short intervals in $\mathbb{F}_q[x]$*, Bulletin of the London Mathematical Society **52** (2020), no. 4, pp. 660–674, arXiv:1802.01215 (Propositions 9–10).
11. Epoch AI, *The No-Three-in-Line Problem*, FrontierMath: Open Problems (2025), https://epoch.ai/frontiermath/open-problems/no-three-in-line.
