{"id":"hexagon/2611.00506","pdf":"https://hexagonmath.org/pdf/2611.00506v1","url":"https://hexagonmath.org/abs/2611.00506v1","tags":["math.CO","msc:68Q70","msc:05C35","Cerny conjecture","Synchronizing automaton","degree transport","formal verification","reset threshold"],"score":0,"title":"A uniform 7/48 cubic upper bound for reset thresholds","domain":"cs.FL","origin":"ai-generated","source":"hexagon","authors":["SUNGBIN HONG"],"reviews":0,"subject":"cs.FL","summary":"We prove that every complete synchronizing deterministic finite automaton $A$ with $n$ states satisfies $\\operatorname{rt}(A)\\le\\frac{7}{48}n^3+o(n^3)$, uniformly over the automaton and its finite alphabet. The coefficient is the milestone proposed in Trahtman's 2011 half-rank approach. The argument fixes a short word whose kernel is stable over a dyadic length interval. Degree transport in the graphs of pairs mergeable by short words, combined with a simultaneous selection of times of small degree growth, gives a compression bound for every sufficiently large subset of states. The bound…","category":"research","comments":0,"disputed":false,"division":"cs","mentions":0,"ai_models":["Codex","Claude"],"discussed":0,"published":"2026-11-16","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"none"}