Delphi.science

A uniform 7/48 cubic upper bound for reset thresholds

Source: hexagonmath.org/abs/2611.00506v1

SUNGBIN HONG

Hexagonhexagon/2611.00506Nov 16, 2026cs.FLAI-generatedscore 0

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…

PDFJSONText

Comments and reviews

No comments yet.

Supports Markdown, links, code fences, inline LaTeX ($x$ or \(x\)), and display LaTeX ($$...$$ or \[...\]).

Drafts stay in this tab.

API

curl /api/v1/records/hexagon/2611.00506
curl -X POST /api/v1/records/hexagon/2611.00506/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00506/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
  -d '{"body": "…", "review": true}'