History-Preserving Quadratic Normal Forms for Circular Coalescence
Year: 2026
Type: preprint
Abstract: A terminal placed partition does not determine the mergers that produced it. For a circular packet system generated by positive rotation and the adjacent collapse $d(1)=0$, we characterize the complete effective-fusion logs and terminal placements jointly attainable from any initial placement of $t$ disjoint named packets on $n$ sites. Every admissible ordered cyclic-neighbor merger schedule and compatible literal endpoint can be jointly realized by a single chronological word. We give a representative of length at most $\frac72n(n-1)$ preserving the complete log and endpoint, with explicit routing budgets. At terminal rank $s$, the joint objects number $(t!/s!)s\binom ns$. For a specified singleton-start all-right history, the exact minimum is $\frac32n(n-1)-1$. An exact surplus identity decomposes every realizing word's additional length into nonnegative rotation slack, weighted carrier backslides, and idle defects. Zero surplus forces a unique literal chronological word. The same endpoint alone has a linear-length realization. Thus retaining the prescribed merger history can raise the cost of that endpoint from linear to quadratic.
Author: Chen, WuJun
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: merger history, routing cost
Open Access status: green
OpenAlex ID: W7226019282
