Papers
Topics
Authors
Recent
Search
2000 character limit reached

Symbolic dynamics of piecewise contractions

Published 3 Mar 2018 in math.DS | (1803.01226v2)

Abstract: A map f: [0,1)→[0,1)f{:}\,[0,1)\to [0,1) is a {\it piecewise contraction of nn intervals} (nn-PC) if there exist $0&lt;\lambda&lt;1$ and a partition of [0,1)[0,1) into intervals I1,…,InI_1,\ldots,I_n such that f∣Iif\vert_{I_i} is λ\lambda-Lipschitz for every 1≤i≤n1\le i\le n. An infinite word θ=θ0θ1…\theta=\theta_0\theta_1\ldots over the alphabet A=1,…,n\mathcal{A}={1,\ldots,n} is a {\it natural coding of} ff if there exists x∈Ix\in I such that θk=i\theta_k=i if and only if f<sup>k(x)∈</sup>Iif<sup>k(x)\in</sup> I_i. We prove that if θ\theta is a natural coding of an injective nn-PC, then some infinite subword of θ\theta is either periodic or isomorphic to a natural coding of a topologically transitive mm-interval exchange transformation (mm-IET), where m≤nm\le n. Conversely, every natural coding of a topologically transitive nn-IET is also a natural coding of some injective nn-PC.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.