← WSFC: Worm Sequence Freedom Closure / WSFC R01 · Polygonal hierarchy and breadth closure

WSFC: Worm Sequence Freedom Closure WSFC R01 · Polygonal hierarchy and breadth closure Neo.K / Aletheia

Polygonal ω-Hierarchy, Insufficiency of Any Finite Order, and Broadworm Breadth Sequence Closure

Starting from published theorems (no fixed segment count n suffices; all simple polygonal unit arcs suffice), frames the n-segment hierarchy (generic freedom d_n = 2n − 2) as 'ω-stage task sufficiency' and derives the elementary bound 0 ≤ b* − t_n ≤ 1/(n − 1), so t_n increases towards b* ≈ 0.43893. The paper states this is not a new Moser worm area bound.

R01 places the broadworm breadth sequence t_n in a finite-order hierarchy and gives an elementary convergence-rate bound; it is not a new bound on the Moser area. The paper itself says the most important conclusion of the round is not a new Moser worm area bound, and lists its non-claims. The 2026 arXiv figures it quotes are other authors' claims.

Connections · Connections

PreviousWSFC-00 · Overview draft and non-claims · Sequence Freedom and Limit Closure of the Possibility Space for the Worm Problem: From Finite-Freedom Expansion and State-Space Evolution to Effective Residuals and a Serializable Infinite Geometry

NextWSFC R02 · The 2007 conjectures and the n = 4, 5, 6 reproduction · Freedom Birth Rate, Broadworm Residual Dynamics, and the Reproduction of the n = 4, 5, 6 Polygonal Extremizers

This is a full-text translation of the Chinese source, which remains authoritative for its research claims. Translation is not independent mathematical verification and does not upgrade the original evidence level.

Loading…