Single-Port Stacked Rings: Bell Universality, Retention Geometry, and Sharp Endpoint Costs

We study two directed rings with independent rotations, adjacent fusion, and one guarded transfer port. A target block family can remain on the lower ring exactly when its blocks are intervals in the source order restricted to the retained atoms; this criterion also determines the minimum transferred atom mass. Every set partition is reachable. For a partition with $b$ blocks, an explicit construction realizes a specified stacked placement in at most $n^2+2n-b-1$ primitive letters. Endpoint requirements produce different sharp costs: a single-vacancy literal endpoint has a unique shortest word of length $n(n-1)$, while an all-upper singleton endpoint has minimum length $3n-2$ and $2^{n-1}$ shortest words for $n\ge3$.The antipodal perfect matching on $2m$ atoms admits a partition-realization length between $7m-7$ and $9m-2$. For the general unordered partition diameter, we obtain $\Omega(n\log n)$ and $O(n^2)$ bounds.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-16
DOI
https://doi.org/10.5281/zenodo.24272179
Primary Topic
Advanced Combinatorial Mathematics
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Single-Port Stacked Rings: Bell Universality, Retention Geometry, and Sharp Endpoint Costs

WuJun Chen
1 links
Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
preprint

Single-Port Stacked Rings: Bell Universality, Retention Geometry, and Sharp Endpoint Costs

WuJun Chen
preprint en

Abstract

We study two directed rings with independent rotations, adjacent fusion, and one guarded transfer port. A target block family can remain on the lower ring exactly when its blocks are intervals in the source order restricted to the retained atoms; this criterion also determines the minimum transferred atom mass. Every set partition is reachable. For a partition with $b$ blocks, an explicit construction realizes a specified stacked placement in at most $n^2+2n-b-1$ primitive letters. Endpoint requirements produce different sharp costs: a single-vacancy literal endpoint has a unique shortest word of length $n(n-1)$, while an all-upper singleton endpoint has minimum length $3n-2$ and $2^{n-1}$ shortest words for $n\ge3$.The antipodal perfect matching on $2m$ atoms admits a partition-realization length between $7m-7$ and $9m-2$. For the general unordered partition diameter, we obtain $\Omega(n\log n)$ and $O(n^2)$ bounds.

Zenodo (CERN European Organization for Nuclear Research)
Advanced Combinatorial Mathematics
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