The topological complexity of Cantor attractors for unimodal interval maps
Simin Li, Weixiao Shen

TL;DR
This paper investigates the topological complexity of Cantor attractors in unimodal interval maps, revealing a typical growth rate of order n log n, with special cases of bounded complexity constructed.
Contribution
It establishes the order of complexity growth for Cantor attractors in unimodal maps and provides explicit examples with bounded complexity.
Findings
Complexity function p(U, n) grows as n log n for typical Cantor attractors.
Constructs a non-renormalizable map with bounded complexity function.
Provides insights into the topological structure of Cantor attractors.
Abstract
For a non-flat unimodal map with a Cantor attractor, we show that for any open cover of this attractor, the complexity function is of order . In the appendix, we construct a non-renormalizable map with a Cantor attractor for which is bounded from above for any open cover .
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 · Chaos control and synchronization
