arXiv Analytics

Sign in

arXiv:1012.2076 [math.DS]AbstractReferencesReviewsResources

Simple permutations with order $4n + 2$. Part I

Primitivo B. Acosta-Humánez, Eduardo Martínez Castiblanco

Published 2010-12-09, updated 2011-10-26Version 2

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 behavior of those periodic points. This paper studies the structure of permutations of mixed order $4n+2$, its properties and a way to describe its genealogy by using Pasting and Reversing.

Comments: 17 pages
Categories: math.DS
Subjects: 37E15, 05A05, 37A99
Related articles: Most relevant | Search more
arXiv:1505.06581 [math.DS] (Published 2015-05-25)
Simple permutations with order $4n + 2$ by means of Pasting and Reversing
arXiv:1011.0529 [math.DS] (Published 2010-11-02)
Equidistribution of periodic points for modular correspondences
arXiv:math/0602100 [math.DS] (Published 2006-02-06, updated 2010-01-12)
The Zeta function, Periodic Points and Entropies of the Motzkin Shift