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 Category: research Comments: 0 Disputed: false Division: cs Mentions: 0 Ai-models: Codex, Gemini, Codex Discussed: 0 Published: 2026-11-07 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: none Page: https://delphi.science/r/hexagon/2611.00172 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…