pith. sign in

arxiv: 1702.03599 · v1 · pith:UX7BA6JPnew · submitted 2017-02-13 · 🧮 math.DS

Complexity of injective piecewise contracting interval maps

classification 🧮 math.DS
keywords complexitycontractingmapspiecewiseaffinediscontinuitiesinjectiveinterval
0
0 comments X
read the original abstract

We study the complexity of the itineraries of injective piecewise contracting maps on the interval. We prove that for any such map the complexity function of any itinerary is eventually affine. We also prove that the growth rate of the complexity is bounded from above by the number $N-1$ of discontinuities of the map. To show that this bound is optimal, we construct piecewise affine contracting maps whose itineraries all have the complexity $(N-1)n +1$. In these examples, the asymptotic dynamics takes place in a minimal Cantor set containing all the discontinuities.

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.