The complexity of Fibonacci-like kneading sequences (Q557842): Difference between revisions

Let \(f: [0,1] \to [0,1]\) be a unimodal map, e.g., \(f_a(x)=ax(1-x)\). The combinatorial properties of \(f\) are completely determined by the sequence \(\{S_k\}\) of its cutting times. The maps which are studied satisfy the relation \(S_k-S_{k-1} = \max \{1, S_{k-d}\}\) for a fixed \(d\geq 1\). For \(d=1\), \(S_k = 2^k\) and the corresponding map is the Feigenbaum map. For \(d=2\), \(S_k\) is the Fibonacci sequence and the map is the Fibonacci map (hence the name Fibonacci-like maps). The Fibonacci-like maps give rise to a zero-entropy minimal one-sided subshift on two symbols, generated by the kneading sequence. In the paper, the word-complexity of such subshifts is computed exactly for \(d\geq 2\). For \(d=1\) it was computed earlier by \textit{G. Rauzy} [Sémin. Théor. Nombres, Univ. Bordeaux I 1982--1983, Exp. No. 25 (1983; Zbl 0547.10048)].