Hostname: page-component-cb9f654ff-65tv2 Total loading time: 0 Render date: 2025-08-18T17:09:20.579Z Has data issue: false hasContentIssue false
  • English
  • Français

On the number of ergodic measures for minimal shifts with eventually constant complexity growth

Published online by Cambridge University Press:  11 April 2016

MICHAEL DAMRON  and
JON FICKENSCHER
MICHAEL DAMRON
Affiliation:
School of Mathematics, Georgia Institute of Technology, 686 Cherry Street, Atlanta, GA 30332, USA email mdamron6@gatech.edu
JON FICKENSCHER
Affiliation:
Mathematics Department, Princeton University, Fine Hall, Washington Road, Princeton, NJ 08544, USA email jonfick@princeton.edu
Get access Rights & Permissions [Opens in a new window]

Abstract

In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and Kra. In this paper, we show that under the stronger assumption of eventually constant growth, an improved bound exists. To this end, we introduce special Rauzy graphs. Variants of the well-known Rauzy graphs from symbolic dynamics, these graphs provide an explicit description of how a Rauzy graph for words of length $n$ relates to the one for words of length $n+1$ for each $n=1,2,3,\ldots \,$ .

Information

Type
Research Article
Information
Ergodic Theory and Dynamical Systems , Volume 37 , Issue 7 , October 2017 , pp. 2099 - 2130
Copyright
© Cambridge University Press, 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Boshernitzan, M.. A unique ergodicity of minimal symbolic flows with linear block growth. J. Anal. Math. 44 (1985), 77–96.Google Scholar
Cassaigne, J.. Special factors of sequences with linear subword complexity. Developments in Language Theory. World Scientific, River Edge, NJ, 1996, pp. 25–34.Google Scholar
Cyr, V. and Kra, B.. Counting generic measures for a subshift of linear growth. Preprint, 2015,arXiv:1505.02748.Google Scholar
Ferenczi, S. and Monteil, T.. Infinite words with uniform frequencies, and invariant measures. Combinatorics, Automata and Number Theory (Encyclopedia of Mathematics and its Applications, 135) . Cambridge University Press, Cambridge, 2010, pp. 373–409.Google Scholar
Ferenczi, S. and Zamboni, L. Q.. Languages of k-interval exchange transformations. Bull. Lond. Math. Soc. 40(4) (2008), 705–714.CrossRefGoogle Scholar
Kanel-Belov, A. and Mitrofanov, I.. Periodicity of Rauzy scheme for substitution words. Preprint, December 2014 (in Russian). ArXiv e-prints.Google Scholar
Katok, A.. Invariant measures of flows on oriented surfaces. Sov. Math. Dokl. 14(4) (1973), 1104–1108.Google Scholar
Keane, M.. Interval exchange transformations. Math. Z. 141(1) (1975), 25–31.CrossRefGoogle Scholar
Keane, M.. Non-ergodic interval exchange transformations. Israel J. Math. 26 (1977), 188–196.CrossRefGoogle Scholar
Veech, W. A.. Moduli spaces of quadratic differentials. J. Anal. Math. 55 (1990), 117–171.Google Scholar
Viana, M.. Ergodic theory of interval exchange maps. Rev. Mat. Complut. 19(1) (2006), 7–100.Google Scholar
Walters, P.. Introduction to Ergodic Theory (Graduate Texts in Mathematics) . Springer, New York, 2000.Google Scholar
Yoccoz, J.-C.. Interval exchange maps and translation surfaces. Homogeneous Flows, Moduli Spaces and Arithmetic (Clay Mathematical Proceedings, 10) . American Mathematical Society, Providence, RI, 2007.Google Scholar