A geometric algorithm to decide the forcing relation on cycles
Let \(f:\mathbb R\rightarrow \mathbb R\) be a continuous map, and \(x_1 < \ldots < x_s\) elements of a periodic orbit orb\(_f(x_1)\) with least period \(s\). In more detail, if \(\eta : \{1,\ldots ,s\}\rightarrow \{1,\ldots ,s\}\) is a bijection satisfying \(\eta ^k(1)\not = 1\) for \(1\leq k < s\) such that \(f(x_i)=x_{\eta (i)}\) then orb\(_f(x_1)\) is said to have the orbit type \(\eta \) (\(x_1\) can be replaced by any \(x_i\) here). Then the forcing relation is defined as follows: \(\vartheta \) forces \(\eta \) if every continuous map \(f\) that has an orbit of type \(\vartheta \) also has an orbit of type \(\eta \). The author presents a new and rather efficient algorithm to determine whether one cycle forces another. It is based on the machinery of oriented graphs and in fact provides much more, namely a certain clarification of the structure of the partial order relation induced by the forcing.
- On the existence of fundamental representatives of cyclic permutations in maps of an interval
- Symbolic representation for a class of unimodal cycles
- Forcing Relations for Homoclinic Orbits of the Smale Horseshoe Map
- Primary Cycles on the Circle
- Comparing Periodic Orbits of Maps of the Interval
- scientific article; zbMATH DE number 177149 (Why is no real title available?)
- On the ordering of 𝑛-modal cycles
- scientific article; zbMATH DE number 781261 (Why is no real title available?)
- Which cycles force uncountably many orbit-types?
This page was built for publication: A geometric algorithm to decide the forcing relation on cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1978902)
