Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-15T15:11:16.939Z 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)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Research Article
Copyright
2003 Cambridge University Press