Topological complexity, return times and weak disjointness
Topological complexity, return times and weak disjointness
复制标题
DOI:
10.1017/s0143385703000543
复制
发表时间:
2004-05
影响因子:
0.9
通讯作者:
Wen Huang;X. Ye
中科院分区:
文献类型:
--
作者:
Wen Huang;X. Ye
In Blanchard et al (Topological complexity. Ergod. Th. & Dynam. Sys.20 (2000), 641–662), the authors introduced the notion of scattering and a weaker notion of 2-scattering. It is an open question whether the two notions are equivalent. The question is answered affirmatively in this paper. Using the complexity function of an open cover along some sequences of natural numbers, we characterize mild mixing, strong scattering and scattering. We show that mildly mixing (respectively strongly mixing) systems are disjoint from minimal uniformly rigid (respectively minimal rigid) systems. Moreover, assuming minimality we show that a dynamical system is full-scattering (respectively mildly mixing or weakly mixing) if and only if it is strongly mixing (respectively IP*-transitive or $\mathcal{D}$-transitive), where $\mathcal{D}$ is the collection of subsets of $\mathbb{Z}_+$ with the lower Banach density 1.