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

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Fusion Elimination and Exact History-Cost Extrema on Stacked Rings

WuJun Chen
Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
preprint

Fusion Elimination and Exact History-Cost Extrema on Stacked Rings

WuJun Chen
preprint en

Abstract

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.

Zenodo (CERN European Organization for Nuclear Research)
semigroups and automata theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon
Fusion Elimination and Exact History-Cost Extrema on Stacked Rings — WuJun Chen · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS