pith. sign in

arxiv: 1401.7027 · v3 · pith:5UNXH7ORnew · submitted 2014-01-27 · 🧮 math.DS · math.NT

Intermediate β-shifts of finite type

classification 🧮 math.DS math.NT
keywords betaalphaintermediateshiftfinitetypecorrespondinggreedy
0
0 comments X
read the original 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 $\beta \in (1, 2)$. Specifically, a classification in terms of the kneading invariants of the linear maps $T_{\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_{\beta, \alpha}$ is a subshift of finite type. It is also proved that these maps $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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.