An algorithm to detect and rigorously verify blenders

Abstract

We present a characterisation of blenders based on mapping properties of certain sets of curves that can be rigorously verified by computer-assisted methods. We develop an algorithm to construct these sets of curves that requires only a rough approximation of the strong unstable direction in a prescribed region. Since our approach does not rely on precise data, such as the exact location of invariant manifolds or fixed points, it provides a systematic framework to verify blenders in explicit examples. Here, we apply this framework to rigorously verify that a family of three-dimensional H\'enon-like maps presents blenders.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…