Hostname: page-component-7dd5485656-6kn8j Total loading time: 0 Render date: 2025-10-31T00:18:07.260Z Has data issue: false hasContentIssue false
  • English
  • Français

Topological sequence entropy and topologically weak mixing

Published online by Cambridge University Press:  17 April 2009

Simin Li
Simin Li
Affiliation:
Department of Mathematical Sciences, University of Tokyo, Komaba 3–8–1, Meguro Ku, Tokyo, Japan e-mail: lisimin@ms.u-tokyo.ac.jp Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, Peoples Republic of China
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

A charactersiation of topologically weak mixing is given by using the topological sequence entropy.

Information

Type
Research Article
Information
Bulletin of the Australian Mathematical Society , Volume 66 , Issue 2 , October 2002 , pp. 207 - 211
Copyright
Copyright © Australian Mathematical Society 2002

References

[1]Blanchard, F., Host, B., and Maass, A., ‘Topological complexity’, Ergodic Theory and Dynamical Systems 20 (2000), 641–662.CrossRefGoogle Scholar
[2]Furstenberg, M., ‘Disjointness in ergodic theory, minimal sets, and a problem in Diophantine approximation’, Math. Systems Theory 1 (1967), 1–49.CrossRefGoogle Scholar
[3]Goodman, T.N.T., ‘Topological sequence entropy’, Proc. London Math.Soc. (3) 29 (1974), 331–350.CrossRefGoogle Scholar
[4]Hulse, P., ‘Sequence entropy and subsequence generators’, J. London Math.Soc. (2) 26 (1982), 441–450.CrossRefGoogle Scholar
[5]Kushnirenko, A.G., ‘On metric invariants of entropy type’, Russian Math. Surveys 22 (1967), 53–61.CrossRefGoogle Scholar
[6]Saleski, A., ‘Sequence entropy and mixing’, J. Math. Anal. Appl. 60 (1977), 58–66.CrossRefGoogle Scholar