Abstract
A map is a piecewise contraction of n intervals (n-PC) if there exist and a partition of into intervals such that for every (). An infinite word over the alphabet is a natural coding of f if there exists such that whenever . We prove that if is a natural coding of an injective n-PC, then some infinite subword of is either periodic or isomorphic to a natural coding of a topologically transitive m-interval exchange transformation (m-IET), where . Conversely, every natural coding of a topologically transitive n-IET is also a natural coding of some injective n-PC.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
