Sharkovsky's Theorem and one-dimensional combinatorial dynamics
Dynamical Systems
2012-01-18 v1 Combinatorics
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.
Cite
@article{arxiv.1201.3583,
title = {Sharkovsky's Theorem and one-dimensional combinatorial dynamics},
author = {Chris Bernhardt},
journal= {arXiv preprint arXiv:1201.3583},
year = {2012}
}
Comments
20 pages