Shift limits of a non-autonomous system
Dawoud Ahmadi Dastjerdi, Mahdi Aghaee

TL;DR
This paper investigates the limits of non-autonomous systems generated by sequences over a finite alphabet, focusing on properties like shadowing and specification, and how these properties extend to generalized iterated function systems.
Contribution
It introduces a framework for analyzing the shift limits of non-autonomous systems and explores which dynamical properties are preserved in the generalized IFS setting.
Findings
Shadowing and specification properties extend to the limit systems.
Transitivity, mixing, and exactness do not necessarily extend.
Periodic points in the limit systems correspond to periodic points in some shift sequence.
Abstract
Let be an element of the full shift with shift map on a finite set of characters and let . Let be a non-autonomous system over a compact metric space where . The set is called the shifted family of . If is a transitive point of the full shift on , then by introducing a natural topology, is a classical IFS; otherwise, is a generalized IFS. We will show that if has some various shadowing and specification properties, then this is true for ; however, this claim is not true for other properties such as transitivity, mixing and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Dynamics and Fractals
