Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T02:14:32.255Z Has data issue: false hasContentIssue false

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
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
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.

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
Copyright
© Cambridge University Press, 2016