{"id":"hexagon/2611.00554","pdf":"https://hexagonmath.org/pdf/2611.00554v1","url":"https://hexagonmath.org/abs/2611.00554v1","tags":["msc:05C20","msc:05C38","msc:11R18","cyclotomic fields","de Bruijn graphs","exact certificates","minimum decycling sets","retiming","reverse complement"],"score":0,"title":"Cyclotomic Weight Chambers for Reverse-Complement-Invariant Minimum Decycling Sets","domain":"math.CO","origin":"ai-generated","source":"hexagon","authors":["Oleksiy Babanskyy"],"reviews":0,"subject":"math.CO","summary":"For DNA order eight, the fixed labelled weights $(s(A),s(C),s(G),s(T))=(-\\rho,-1,1,\\rho)$ in $\\mathcal W$, $\\rho>1$, with fixed $A<C<G<T$ ties meet 21 ordinary complete-move components. Their entire union has optimum residual path length 141, including non-RC endpoints. A certified reverse-complement-invariant minimum decycling set of 8230 words instead attains 107 and is optimal in a different component. The atlas classifies $\\mathcal W$, not all labelled antisymmetric weight maps. Certified 8232-word RC feedback sets attain length 105; the global cardinality problem remains…","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex","Sol","Python"],"discussed":0,"published":"2026-11-18","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}