Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-15T22:54:46.273Z Has data issue: false hasContentIssue false

On subshifts with slow forbidden word growth

Published online by Cambridge University Press:  12 January 2021

RONNIE PAVLOV*
Affiliation:
Department of Mathematics, University of Denver, 2390 S. York St., Denver, CO 80208, USA (www.math.du.edu/~rpavlov/)
*
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 this work, we treat subshifts, defined in terms of an alphabet $\mathcal {A}$ and (usually infinite) forbidden list $\mathcal {F}$, where the number of n-letter words in $\mathcal {F}$ has ‘slow growth rate’ in n. We show that such subshifts are well behaved in several ways; for instance, they are boundedly supermultiplicative in the sense of Baker and Ghenciu [Dynamical properties of S-gap shifts and other shift spaces. J. Math. Anal. Appl. 430(2) (2015), 633–647] and they have unique measures of maximal entropy with the K-property and which satisfy Gibbs bounds on large (measure-theoretically) sets. The main tool in our proofs is a more general result, which states that bounded supermultiplicativity and a sort of measure-theoretic specification property together imply uniqueness of the measure of maximum entropy and our Gibbs bounds. We also show that some well-known classes of subshifts can be treated by our results, including the symbolic codings of $x \mapsto \alpha + \beta x$ (the so-called $\alpha $-$\beta $ shifts of Hofbauer [Maximal measures for simple piecewise monotonic transformations. Z. Wahrsch. verw. Geb. 52(3) (1980), 289–300]) and the bounded density subshifts of Stanley [Bounded density shifts. Ergod. Th. & Dynam. Sys. 33(6) (2013), 1891–1928].

Information

Type
Original Article
Creative Commons
Creative Common License - CCCreative Common License - BY
This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted re-use, distribution, and reproduction in any medium, provided the original work is properly cited.
Copyright
© The Author(s), 2021. Published by Cambridge University Press