arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0801.1635math.DS

Chain recurrence rates and topological entropy

David Richeson, Jim 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 $\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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑