Simple permutations with order by means of Pasting and Reversing
arXiv:1505.06581
Abstract
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Humánez \& Bernhardt (power of two). It is well known that Sharkovskii's theorem shows the relationship between the cardinal of the set of periodic points of a continuous map, but simple permutations will show the behaviour of those periodic points. Recently Abdulla et al studied the structure of minimal -orbits of the continuous endomorphisms on the real line. This paper studies some combinatorial dynamics structures of permutations of mixed order , describing its genealogy, using Pasting and Reversing.
arXiv comment29 pages, 4 figures