Intermediate \beta-shifts of finite type
Abstract
An aim of this article is to highlight dynamical differences between the greedy, and hence the lazy, -shift (transformation) and an intermediate -shift (transformation), for a fixed . Specifically, a classification in terms of the kneading invariants of the linear maps for which the corresponding intermediate -shift is of finite type is given. This characterisation is then employed to construct a class of pairs such that the intermediate -shift associated with is a subshift of finite type. It is also proved that these maps are not transitive. This is in contrast to the situation for the corresponding greedy and lazy -shifts and -transformations, for which both of the two properties do not hold.
Keywords
Cite
@article{arxiv.1401.7027,
title = {Intermediate \beta-shifts of finite type},
author = {Bing Li and Tuomas Sahlsten and Tony Samuel},
journal= {arXiv preprint arXiv:1401.7027},
year = {2019}
}
Comments
v3: 19 pages, 6 figures, fixed typos and minor errors, to appear in Discrete Contin. Dyn. Syst. A