{"id":"hexagon/2611.00172","pdf":"https://hexagonmath.org/pdf/2611.00172v1","url":"https://hexagonmath.org/abs/2611.00172v1","tags":["msc:68Q70","Synchronizing automaton","avoiding word","merge graph","reset threshold","Černý conjecture"],"score":0,"title":"Degree Transport and a Smaller Cubic Coefficient for Reset Thresholds","domain":"cs.FL","origin":"ai-generated","source":"hexagon","authors":["SUNGBIN HONG"],"reviews":0,"subject":"cs.FL","summary":"We prove that every synchronizing complete deterministic finite automaton on $n\\ge2$ states has reset threshold at most $\\frac{8242}{49923}n^3+O(n^2)$. The cubic coefficient improves on Shitov's $8257/49923$ by $5/16641$. The main ingredient is a degree-transport inequality for graphs of state pairs mergeable by short words. It relates a long gap between consecutive minimum-rank word lengths to a large corank achievable in at most $n-1$ letters. Combining this relation with a discrete dual of Shitov's counting argument gives the improvement. An appendix makes the quadratic remainder explicit…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Codex","Gemini","Codex"],"discussed":0,"published":"2026-11-07","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}