Chain recurrence rates and topological entropy
Dynamical Systems
2008-06-05 v2
Abstract
We investigate the properties of chain recurrent, chain transitive, and chain mixing maps (generalizations of the well-known notions of non-wandering, topologically transitive, and topologically mixing maps). We describe the structure of chain transitive maps. These notions of recurrence are defined using -chains, and the minimal lengths of these -chains give a way to measure recurrence time (chain recurrence and chain mixing times). We give upper and lower bounds for these recurrence times and relate the chain mixing time to topological entropy.
Cite
@article{arxiv.0801.1635,
title = {Chain recurrence rates and topological entropy},
author = {David Richeson and Jim Wiseman},
journal= {arXiv preprint arXiv:0801.1635},
year = {2008}
}