Fusion Elimination and Exact History-Cost Extrema on Stacked Rings
We study a guarded packet system on two directed rings, with independent rotations, adjacent fusion and a one-way transfer port. An observation retains the complete ordered fusion and whole-packet transfer log together with the literal endpoint. Its total premium is the minimum realizing word length minus the minimum cost of the same unordered partition. For $n\ge3$, the maximum premium in the entire one-block fibre and the maximum over all observations ending wholly in the upper layer both equal $5\binom n2+K_n-n+2$, where $K_n$ is an attained auxiliary singleton-extraction maximum. The all-upper result permits arbitrary packet masses, ordered fusion forests and legal event interleavings. A rotating reservation cursor controls the upper replay; an erasure-shadow simulation eliminates each lower fusion at cost at most $2n-1$. For singleton transfers, a cyclic gap moment and a joint structural defect retain explicit savings in the same physical replay. The cyclic realization and quadratic replay foundations are proved here. Any larger global premium must come from a multiblock endpoint with at least one lower-layer survivor.
Authors
- WuJun Chen (ORCID: https://orcid.org/0009-0007-9561-2892)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-20
- DOI
- https://doi.org/10.5281/zenodo.24404155
- Primary Topic
- semigroups and automata theory
- Type
- preprint