Hostname: page-component-cb9f654ff-nr592 Total loading time: 0 Render date: 2025-08-18T17:09:18.196Z Has data issue: false hasContentIssue false

Maximal entropy of permutations of even order

Published online by Cambridge University Press:  01 December 1997

Abstract

A finite invariant set of a continuous map of an interval induces apermutation called its type. If this permutation is a cycle, it is calledits orbit type. It has been shown by Geller and Tolosa thatMisiurewicz–Nitecki orbit types of period $n$ congruent to $1$ (mod 4)andtheirgeneralizations to orbit types of period $n$ congruent to $3$(mod 4) havemaximal entropy among all orbit types of odd period $n$, and indeedamongall permutations of period $n$. We further generalize this family topermutations of even period $n$ and show that they again attain maximalentropyamongst $n$-permutations.

Information

Type
Research Article
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable