Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T15:35:52.910Z Has data issue: false hasContentIssue false

The number of ergodic measures for transitive subshifts under the regular bispecial condition

Published online by Cambridge University Press:  29 December 2020

MICHAEL DAMRON
Affiliation:
School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA 30332, USA (e-mail: mdamron6@math.gatech.edu)
JON FICKENSCHER*
Affiliation:
Mathematics Department, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544, USA
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

If $\mathcal {A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal {A}^{\mathbb {N}}$ of sequences with entries in $\mathcal {A}$, along with the left shift operator S. Closed S-invariant subsets are called subshifts and arise naturally as encodings of other systems. In this paper, we study the number of ergodic measures for transitive subshifts under a condition (‘regular bispecial condition’) on the possible extensions of words in the associated language. Our main result shows that under this condition, the subshift can support at most $({K+1})/{2}$ ergodic measures, where K is the limiting value of $p(n+1)-p(n)$, and p is the complexity function of the language. As a consequence, we answer a question of Boshernitzan from 1984, providing a combinatorial proof for the bound on the number of ergodic measures for interval exchange transformations.

Information

Type
Original Article
Copyright
© The Author(s), 2020. Published by Cambridge University Press