On entropy of pure mixing maps on dendrites

Read full text
Authors: Dominik Kwietniak, Piotr Oprocha, Jakub Tomaszewski
Cited by: 0

Abstract

For every dollar sign 0 less than alpha less than or equals infinity dollar sign $0 \lt \alpha\le\infty$ 0 < α ≤ ∞ $ we construct a continuous pure mixing map (topologically mixing, but not exact) on the Gehman dendrite with topological entropy dollar sign alpha dollar sign $\alpha$ $ α $ . It has been previously shown by Špitalský that there are exact maps on the Gehman dendrite with arbitrarily low positive topological entropy. Together, these results show that the entropy of maps on the Gehman dendrite does not exhibit the paradoxical behaviour reported for graph maps, where the infimum of the topological entropy of exact maps is strictly smaller than the infimum of the entropy of pure mixing maps. The latter result, stated in terms of popular notions of chaos, says that for maps on graphs, lower entropy implies stronger Devaney chaos. The conclusion of this paper says that lower entropy does not force stronger chaos for maps of the Gehman dendrite.

Fields of Study & Subjects

Mathematical Dynamics and Fractals Chaos control and synchronization Quantum chaos and dynamical systems

Publication details

Journal / source
Proceedings of the Royal Society of Edinburgh Section A Mathematics
Pages
1–18
Publication date
21 May 2026
Language
EN