Hostname: page-component-8448b6f56d-c4f8m Total loading time: 0 Render date: 2024-04-24T12:05:46.517Z Has data issue: false hasContentIssue false

Topological complexity, return times and weak disjointness

Published online by Cambridge University Press:  04 May 2004

WEN HUANG
Affiliation:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, People's Republic of China (e-mail: wenh@mail.ustc.edu.cn, yexd@ustc.edu.cn)
XIANGDONG YE
Affiliation:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui, 230026, People's Republic of China (e-mail: wenh@mail.ustc.edu.cn, yexd@ustc.edu.cn)

Abstract

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.

Type
Research Article
Copyright
2004 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)