Adding machines, kneading maps, and endpoints (Q624425): Difference between revisions
From MaRDI portal
Latest revision as of 05:23, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Adding machines, kneading maps, and endpoints |
scientific article |
Statements
Adding machines, kneading maps, and endpoints (English)
0 references
9 February 2011
0 references
Let \(f:[0,1]\rightarrow [0,1]\) be a unimodal map with turning point \(c\) and let \(c_i=f^i(c)\) for all \(i\in\mathbb N.\) Assume \( c_2<c<c_1\) and \(c_2\leq c_3\) and denote \(I=[c_2, c_3]\). Then \(I\) is \(f\)-invariant and let \((I, f)\) be the inverse limit space. Set \(\mathcal{E}=\{(x_0,x_1,\cdots)\in(I,f)|x_i\in\omega(c, f),\;\forall i\in\mathbb N\}\), where \(\omega(c, f)\) is the \(\omega\)-limit set of \(c\). It is known that there exist strange adding machines embedded in symmetric tent maps \(f\) such that the collection of endpoints of \((I,f)\) is a proper subset of \(\mathcal{E}\) and such that \(\lim_{k\to\infty}Q(k)\not=\infty,\) where \(Q(k)\) is the kneading map. In the present paper, the authors use the partition structure of an adding machine to provide a sufficient condition for \(x\) to be an endpoint of \((I, f)\) in the case of an embedded adding machine. Then they show that there exist strange adding machines embedded in symmetric tent maps for which the collection of endpoints of \((I,f)\) is precisely \(\mathcal{E}\). Examples of this behavior are provided where \(\lim_{k\to\infty}Q(k)\) does and does not equal infinity, and in the case where \(\lim_{k\to\infty}Q(k)=\infty\), it is shown that the collection of endpoints of \((I, f)\) is always \(\mathcal{E}\).
0 references
adding machines
0 references
inverse limit spaces
0 references
kneading maps
0 references
endpoints
0 references