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 Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: Codex Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: no-human-author-claimed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00313 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.