z-logo
open-access-imgOpen Access
Counting preimages
Author(s) -
Michał Misiurewicz,
Ana Rodrigues
Publication year - 2017
Publication title -
ergodic theory and dynamical systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.571
H-Index - 61
eISSN - 1469-4417
pISSN - 0143-3857
DOI - 10.1017/etds.2016.103
Subject(s) - mathematics , topological entropy , entropy (arrow of time) , topological conjugacy , probability measure , rényi entropy , invertible matrix , subshift of finite type , piecewise , discrete mathematics , pure mathematics , monotone polygon , combinatorics , mathematical analysis , principle of maximum entropy , statistics , physics , geometry , quantum mechanics
For non-invertible maps, subshifts that are mainly of finite type and piecewise monotone interval maps, we investigate what happens if we follow backward trajectories, which are random in the sense that, at each step, every preimage can be chosen with equal probability. In particular, we ask what happens if we try to compute the entropy this way. It turns out that, instead of the topological entropy, we get the metric entropy of a special measure, which we call the fair measure. In general, this entropy (the fair entropy) is smaller than the topological entropy. In such a way, for the systems that we consider, we get a new natural measure and a new invariant of topological conjugacy

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom