Chain recurrence rates and topological entropy

Simple item page
dc.creatorRicheson, David
dc.creatorWiseman, Jim
dc.date2008-01-10
dc.date2008-06-05
dc.date.accessioned2026-07-07T09:42:31Z
dc.date.available2026-07-07T09:42:31Z
dc.descriptionWe 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 $\ep$-chains, and the minimal lengths of these $\ep$-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.
dc.identifierhttps://arxiv.org/abs/0801.1635
dc.identifierhttp://arxiv.org/abs/0801.1635
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/162209
dc.subjectDynamical Systems
dc.subject37B20, 37A25, 37B40
dc.titleChain recurrence rates and topological entropy
dc.typetext

Files

Collections

arXiv