An estimate for the number of periodical trajectories of the given period for mapping of an interval, Lucas numbers, and necklaces
For a continuous interval map with a periodic orbit of period 3, the author finds a lower bound for the number of periodic orbits of period \(n\). The bound employs the Möbius function and Lucas numbers and is proven through a combinatorial result. The author uses a certain skew tent map \(f\) to show the sharpness of the bound. Furthermore, all periodic points of \(f\) are described. As an application, an explicit formula for the number of necklaces of a special kind is found.
- Sharkovskii's ordering and estimates of the number of periodic trajectories of given period of a self-map of an interval
- On an extension of Sarkovskii's order
- Remarks on Sharkovsky's theorem
- The minimal number of periodic orbits of periods guaranteed in Sharkovskii's theorem
- THIRTY YEARS AFTER SHARKOVSKIĬ'S THEOREM
- An elementary approach to dynamics and bifurcations of skew tent maps
- scientific article; zbMATH DE number 47709 (Why is no real title available?)
- scientific article; zbMATH DE number 3197700 (Why is no real title available?)
- Making mathematics come to life. A guide for teachers and students. Transl. from the Russian by Robert Burns
- Period Three Implies Chaos
This page was built for publication: An estimate for the number of periodical trajectories of the given period for mapping of an interval, Lucas numbers, and necklaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2289414)