SearcharxivSearch

arXiv · 2506.13515

Complexity of Coexistence Regions in the GRHT Map

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 number of vertices of the most common overlapping regions via optimization techniques. We study the variation of the number of vertices and area of the most common overlapping region with the variation in parameters of the map. It illustrates that when the number of coexisting stable periodic orbits increase, the area of the most common overlapping region decreases. Moreover the number of vertices of the most common overlapping region increases as the number of coexisting stable periodic orbits increases. We also explore the variation of the area and the number of vertices of the most common overlapping region with the simultaneous variation of two parameters of the GRHT map. It reveals that the variation in the number of vertices of the most common overlapping region is not trivial and varies in a highly nonlinear fashion illustrating the geometric complexity of the coexisting regions of stable periodic orbits in the parameter space.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sishu Shankar Muni. 2025-06-16. Complexity of Coexistence Regions in the GRHT Map. https://arxiv.org/abs/2506.13515

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Linear Response Predicts Cusp-Pair Births in Networks with a Localized Cubic

Linear response is cheap to measure; the bistability boundaries it organizes are not. For a passive network with one localized cubic, the driving-point receptance $G$ fixes the period-one cusp set at fundamental-harmonic order: cusps lie on a fixed phase contour of $G$, a tangency of that contour under parameter variation creates a pair, and its curvature separates a gap opening from an isolated loop. For a two-mode absorber the linear prediction locates a benchmark birth coupling to $0.3\%$, and to $0.03\%$ once a third-harmonic correction of scale $|G(3\Omega)/G(\Omega)|$ is included.

nlin.CD

Dynamics Creation through Neural Dynamical Transfer Learning

Data-driven machine learning has established a robust foundation for reconstructing nonlinear dynamical systems from observations, primarily for the purposes of forecasting and control. However, most existing efforts focus on recovering specific observed dynamics rather than the generative synthesis of new ones. Inspired by image fusion and style transfer, we introduce a neural network framework termed Neural Dynamical Transfer Learning (NDTL) to create new systems with prescribed dynamics from pairs of parent nonlinear dynamical systems. By computing fundamental dynamical signatures, including the intrinsic dimension, the Kaplan-Yorke dimension, the invariant measure statistics, and the Lyapunov spectrum, we demonstrate that NDTL preserves key features inherited from the parent models while simultaneously generating novel dynamics. Beyond these validation examples, NDTL induces a criterion for dynamics classification, creates stable oscillatory coexistence in the Hastings-Powell food chain model, produces interpretable epidemiological models, and provides a chaotic source for image encryption.

nlin.CD

The Spectral Skeleton of Chaos: Koopman Wave Packets on Poincar\'e Sections

A Poincar\'e section replaces a flow by a return map, but for a chaotic system this map is usually known only from sampled crossings. We show that coarse transport can be read directly from Koopman spectral data, without fitting the map. Measure-preserving EDMD retains the isometric structure; riggedDMD then approximates spectral measures and constructs finite regularized wave packets. Packet phase supplies a finite-resolution transport coordinate; low modulus marks a singular skeleton where the phase becomes ill-conditioned. We demonstrate the idea on the R\"ossler system, a 32-mode Kuramoto--Sivashinsky Galerkin system, and the forced Duffing oscillator. The packets yield coarse symbolic models on sections ranging from an almost one-dimensional curve to a visibly thick set. Their graphs organize observed low-period orbits and guide targeted searches for others. In Duffing Regime~II, a seven-region rule accounts for $91\%$--$94\%$ of filtered one-step transitions, while failures in the lowest retained modulus decile occur at $5.08$--$5.20$ times the overall rate. The packets are not Koopman eigenfunctions, nor are the regions exact Markov partitions. Together these computations show how spectral information beyond isolated eigenpairs can expose chaotic transport directly from trajectories.

nlin.CD