Complexity of Coexistence Regions in the GRHT Map
Sishu Shankar Muni

TL;DR
This paper studies the geometric complexity of coexistence regions of stable periodic orbits in the GRHT map, revealing polygonal convex regions and how their properties change with parameters.
Contribution
It introduces a parameterized non-invertible GRHT map, develops an algorithm to analyze overlapping regions, and explores how these regions' geometry varies with parameters.
Findings
Coexistence regions are convex polygons in parameter space.
Number of vertices increases with the number of coexisting orbits.
Area of the overlapping region decreases as the number of coexisting orbits increases.
Abstract
GRHT map refers to a planar map which showcases the coexistence of infinitely many stable periodic orbits via the phenomenon of Globally Resonant Homoclinic Tangencies. This paper investigates the geometric properties of coexistence regions in the case of codimension-three scenario. We introduce parameters into the non-invertible GRHT map to understand the unfolding behavior of the GRHT. Near the infinite coexistence regions, there exists series of codimension-one saddle-node and period-doubling bifurcations. The most common overlapping region in the parameter space reveals the parameters with which there can be coexisting periodic orbits. Various slices of parameter space are considered to understand the coexistence regions in two-dimensional parameter space. We show that the parameter region of coexistence are polygons and are convex sets. We develop an algorithm that detects the…
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
TopicsMethane Hydrates and Related Phenomena · Distributed and Parallel Computing Systems
