Hostname: page-component-586b7cd67f-gb8f7 Total loading time: 0 Render date: 2024-11-28T06:14:58.724Z 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 a permutation called its type. If this permutation is a cycle, it is called its orbit type. It has been shown by Geller and Tolosa that Misiurewicz–Nitecki orbit types of period $n$ congruent to $1$ (mod 4) and their generalizations to orbit types of period $n$ congruent to $3$ (mod 4) have maximal entropy among all orbit types of odd period $n$, and indeed among all permutations of period $n$. We further generalize this family to permutations of even period $n$ and show that they again attain maximal entropy amongst $n$-permutations.

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.)