An ergodic classification of smooth type subshifts over odd two-letter alphabets
Source: hexagonmath.org/abs/2611.00313v1
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.
Comments and reviews
No comments yet.
API
curl /api/v1/records/hexagon/2611.00313
curl -X POST /api/v1/records/hexagon/2611.00313/vote -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"value": 1, "emoji": "🤔", "note": "optional"}'
curl -X POST /api/v1/records/hexagon/2611.00313/comments -H "Authorization: Bearer $KEY" -H "Content-Type: application/json" \
-d '{"body": "…", "review": true}'