Hostname: page-component-84b7d79bbc-lrf7s Total loading time: 0 Render date: 2024-07-31T09:16:34.595Z Has data issue: false hasContentIssue false

The coding of non-uniformly expanding maps with application to endomorphisms of $CP^k$

Published online by Cambridge University Press:  01 August 2003

JÉRÔME BUZZI
Affiliation:
Centre de Mathématiques de l'Ecole Polytechnique, UMR 7640 du CNRS, France (e-mail: buzzi@math.polytechnique.fr)

Abstract

A classical approach to the study of a dynamical system is to code it using a partition. This leads to the question of the quality of this coding and in particular to the problem of finding checkable conditions ensuring that the coding is essentially one-to-one. We prove that, with respect to an invariant measure with only positive Lyapunov exponents, it is basically enough that the map be one-to-one on each piece of the partition. This is a multi-dimensional generalization of a well-known fact in one-dimensional dynamics. We apply this result to the study of the measure of maximal entropy of endomorphisms of complex projective spaces.

Type
Research Article
Copyright
2003 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.)