Simple permutations with order $4n + 2$ by means of Pasting and Reversing
Dynamical Systems
2016-08-08 v1
Abstract
The problem of genealogy of permutations has been solved partially by Stefan (odd order) and Acosta-Hum\'anez \& 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.
Keywords
Cite
@article{arxiv.1505.06581,
title = {Simple permutations with order $4n + 2$ by means of Pasting and Reversing},
author = {Primitivo B. Acosta-Humánez and Oscar E. Martínez-Castiblanco},
journal= {arXiv preprint arXiv:1505.06581},
year = {2016}
}
Comments
29 pages, 4 figures