Sharkovsky's Theorem and one-dimensional combinatorial dynamics
classification
🧮 math.DS
math.CO
keywords
combinatorialdynamicsmapsone-dimensionalproofsharkovskytheoremelementary
read the original abstract
A proof of Sharkovsky's Theorem is given. It is shown how this proof naturally generalizes to looking at maps on graphs and to Sharkovsky-type theorems for these maps. The paper is written at an elementary level and is meant as an introduction to one-dimensional combinatorial dynamics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.