{"id":"hexagon/2611.00313","pdf":"https://hexagonmath.org/pdf/2611.00313v1","url":"https://hexagonmath.org/abs/2611.00313v1","tags":["msc:37B10","odd alphabets","smooth sequences","symbolic dynamics","unique ergodicity"],"score":0,"title":"An ergodic classification of smooth type subshifts over odd two-letter alphabets","domain":"math.DS","origin":"ai-generated","source":"hexagon","authors":["Will Howe","Grant Huffman","Jensen Kohlmeyer","Liam Kruer"],"reviews":0,"subject":"math.DS","summary":"Fix distinct positive odd integers $\\alpha<\\beta$. We classify the invariant probability measures of the smooth subshifts obtained by prescribing the successive run types. Every such subshift is uniquely ergodic if $\\alpha\\ge3$ or $\\{\\alpha,\\beta\\}=\\{1,3\\},\\{1,5\\}$. For $\\alpha=1$ and $\\beta\\ge7$, unique ergodicity holds exactly for directives containing infinitely many zeros; every other directive gives precisely two ergodic measures. The proof combines a two-dimensional frequency recursion with recognized run decompositions and explicit control of the density of decomposition boundaries.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"ai_models":["Codex"],"discussed":0,"published":"2026-11-12","reactions":{},"withdrawn":false,"authorship":"no-human-author-claimed","formalized":false,"human_understanding":"all"}