Chain recurrence rates and topological entropy
Chain recurrence rates and topological entropy
复制标题
DOI：
10.1016/j.topol.2008.07.005
复制
发表时间：
2008-01
影响因子：
0.6
通讯作者：
David Richeson;J. Wiseman
中科院分区：
文献类型：
--
作者：
David Richeson;J. Wiseman
我们研究了链递归映射、链传递映射和链混合映射的性质（非游荡映射、拓扑传递映射和拓扑混合映射的著名概念的推广）。我们描述了链传递映射的结构。这些递归概念是使用ε-链定义的，这些ε-链的最小长度提供了一种测量递归时间（链递归和链混合时间）的方法。我们给出了这些递归时间的上界和下界，并将链混合时间与拓扑熵联系起来。
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.