Hostname: page-component-78c5997874-4rdpn Total loading time: 0 Render date: 2024-11-03T00:28:42.308Z Has data issue: false hasContentIssue false

Chain recurrent points of a tree map

Published online by Cambridge University Press:  17 April 2009

Tao Li
Affiliation:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, Peoples Republic of China e-mail: [email protected]
Xiangdong Ye
Affiliation:
Department of Mathematics, University of Science and Technology of China, Hefei, Anhui 230026, Peoples Republic of China e-mail: [email protected]
Rights & Permissions [Opens in a new window]

Abstract

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.

We generalise a result of Hosaka and Kato by proving that if the set of periodic points of a continuous map of a tree is closed then each chain recurrent point is a periodic one. We also show that the topological entropy of a tree map is zero if and only if the w-limit set of each chain recurrent point (which is not periodic) contains no periodic points.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1999

References

[1]Alseda, L. and Ye, X., ‘No-division and the set of periods for tree maps’, Ergodic Theory Dynamical Systems 15 (1995), 221237.CrossRefGoogle Scholar
[2]Block, L., ‘Continuous maps of the interval with finite nonwandering set’, Trans. Amer. Math. Soc. 240 (1978), 221230.CrossRefGoogle Scholar
[3]Block, L. and Coppel, W.A., Dynamics in one dimension, Lect. Notes in Math. 1513 (Springer-Verlag, Berlin, Heidelberg, New York, 1992).CrossRefGoogle Scholar
[4]Franks, J. and Misiurewicz, M., ‘Cycles for disk homeomorphisms and thick trees’, Contemp. Math. 152 (1993), 69139.CrossRefGoogle Scholar
[5]Hosaka, H. and Kato, H., ‘Continuous maps of trees and non-wandering sets’, Topology Appl. 81 (1997), 3546.CrossRefGoogle Scholar
[6]Nitecki, Z., ‘Maps of the interval with closed periodic set’, Proc. Amer. Math. Soc. 85 (1982), 451456.CrossRefGoogle Scholar
[7]Li, T., Misiurewicz, M., Pianigian, G. and Yorke, J., ‘Odd chaos’, Physics Lett. A 87 (1981), 271273.CrossRefGoogle Scholar
[8]Llibre, J. and Misiurewicz, M., ‘Horseshoe, entropy and periods for graph maps’, Topology 32 (1993), 649664.CrossRefGoogle Scholar
[9]Walters, P., An introduction to ergodic theory (Springer-Verlag, Berlin, Heidelberg, New York, 1982).CrossRefGoogle Scholar
[10]Ye, X., ‘The center and the depth of the center of a tree map’, Bull. Austral. Math. Soc. 48 (1993), 347350.CrossRefGoogle Scholar
[11]Ye, X., ‘Tree maps with non divisible periodic orbits’, Bull. Austral. Math. Soc. 56 (1997), 467471.CrossRefGoogle Scholar
[12]Ye, X., ‘D-function of a minimal set and an extension of Sharkovskii' theorem’, Ergod. Theory Dynamical Systems 12 (1992), 365376.CrossRefGoogle Scholar
[13]Zhou, Z., ‘Self-mappings of the interval without homoclinic points’, (in Chinese), Acta. Math. Sinica 25 (1982), 633640.Google Scholar
[14]Zhang, J. and Xiong, J., Iterations of functions and one-dimensional dynamics, (in Chinese) (Sichuan Education Press, 1992).Google Scholar