Monotone Maps on dendrites and their induced maps
Haithem Abouda, Issam Naghmouchi

TL;DR
This paper studies monotone maps on dendrites, showing that their omega-limit sets are approximated by periodic orbits and exploring the dynamics of induced maps, revealing differences in complexity among various induced systems.
Contribution
It proves properties of omega-limit sets for monotone maps on dendrites and analyzes the dynamics of induced maps on different hyperspaces, highlighting cases with and without chaos.
Findings
Omega-limit sets are approximated by periodic orbits.
The set of omega-limit sets is closed in the Hausdorff metric.
Induced maps on finite subsets and subtrees lack Li-Yorke chaos, unlike the map on sub-continua.
Abstract
A continuum is a dendrite if it is locally connected and contains no simple closed curve, a self mapping of is called monotone if the preimage of any connected subset of is connected. If is a dendrite and is a monotone continuous map then we prove that any -limit set is approximated by periodic orbits and the family of all -limit sets is closed with respect to the Hausdorff metric. Second, we prove that the equality between the closure of the set of periodic points, the set of regularly recurrent points and the union of all -limit sets holds for the induced maps and where denotes the family of finite subsets of with at most points, denotes the family of subtrees of with at…
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.
