Glendinning chaos

A continuous interval map is chaotic in Glendinning's sense when some positive iterate has a horseshoe for an interval map.

An interval map $F:I\to I$ has a horseshoe when there are an open interval $J\subseteq I$ and disjoint open intervals $K_0,K_1\subseteq J$ such thatIterating inverse branches produces full two-symbol itinerary dynamics.

If a directed covering graph of an interval map has two distinct closed walks of the same length $n$, based at the same interval and with different first edges, successive use of the interval covering relation produces two subintervals with disjoint interiors that $F^n$ maps across the base interval. Hence $F^n$ has a horseshoe for an interval map.

Order the positive integers by odd numbers from $3$ upward, then twice the odds, then four times the odds, and so on, followed by descending powers of two and finally $1$. If a continuous interval map has a cycle of one period, it has cycles of every period later in this order. In particular, period three forces every positive period.

A period-three orbit forces an interval-covering graph with adjacency matrixIts number of closed pointed length-$n$ itineraries is $\mathrm{tr}(A^n)=L_n$. Möbius removal of lower periods and division by $n$ give four primitive cyclic classes at $n=7$ and five at $n=8$.