Pseudo-riddling in chaotic systems (Q5936242)

The paper is motivated by the fact that chaos can not only occur on chaotic attractors, but it can also come from non-attracting chaotic saddles. In particular, a chaotic system can operate in one of the infinite number of periodic windows in which a chaotic saddle and a stable periodic attractor coexist. It is argued that the basin of the periodic attractor in the invariant subspace contains both an open set and a set of measure zero with riddled holes that belong to the basin of another attractor. The author claims that due to dynamical interplay between the non-attracting chaotic saddle and the stable periodic attractor, riddling can be more pervasive than riddling of chaotic attractors because it can occur regardless of whether the chaotic saddle in the invariant subspace is transversely stable or unstable. An analyzable model is constructed, a scaling law for pseudo-riddling is obtained, and numerical support is provided.