English

Intermediate \beta-shifts of finite type

Dynamical Systems 2019-02-14 v3 Number Theory

Abstract

An aim of this article is to highlight dynamical differences between the greedy, and hence the lazy, β\beta-shift (transformation) and an intermediate β\beta-shift (transformation), for a fixed β(1,2)\beta \in (1, 2). Specifically, a classification in terms of the kneading invariants of the linear maps Tβ,α ⁣:xβx+αmod1T_{\beta,\alpha} \colon x \mapsto \beta x + \alpha \bmod 1 for which the corresponding intermediate β\beta-shift is of finite type is given. This characterisation is then employed to construct a class of pairs (β,α)(\beta,\alpha) such that the intermediate β\beta-shift associated with Tβ,αT_{\beta, \alpha} is a subshift of finite type. It is also proved that these maps Tβ,αT_{\beta,\alpha} are not transitive. This is in contrast to the situation for the corresponding greedy and lazy β\beta-shifts and β\beta-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