Predavateljica: Klára Karasová (Charles University)
Povzetek: Among all notions of chaos, there are three widely accepted: Devaney chaos, Li-Yorke chaos and (positive) topological entropy. It is known that exact Devaney chaos – an exact map with dense set of periodic points – implies all three.
Various results establish the existence of maps with properties related to chaos (e.g., transitivity) for specific spaces such as the interval, the Cantor set or the Lelek fan, as well as for broader classes, including manifolds and dendrites. Moreover, chaotic behavior often emerges as a generic phenomenon in the sense of Baire category.
Inspired by some of the previous results, jointly with B. Vejnar we prove that every Peano continuum (i.e. a locally connected continuum) admits exact Devaney chaos. Additionally, we generalize some prior results by showing that if a Peano continuum X satisfies the condition that selfmaps locally constant on some dense open subset form a dense subset of all selfmaps, then:
• exactly Devaney chaotic maps form a dense subset of chain transitive selfmaps of X,
• mixing is generic among chain transitive selfmaps of X,
• shadowing is generic among all selfmaps of X.
Given that all Peano continua admit exact Devaney chaos, a natural question arises: do they also admit a mixing but non-exact Devaney chaotic map? We answer this affirmatively jointly with M. Kowalewski and P. Oprocha by analyzing the role of local cut points in Peano continua. We also derive consequences for the topological entropy of the constructed map. We say that a map f : X → X is strongly mixing, if for every nonempty open U ⊂ X and every x ∈ X there exists n_0 such that for every n ≥ n_0 it holds that x ∈ f^n(U). It is easy to see that strong mixing is stronger than mixing but weaker than exactness. Further, it is easy to prove that every strong mixing selfmap of a tree is already exact. A natural question whether strong mixing and exact selfmaps coincide for some other class of spaces has been of interest since then.
Recently, Illanes and Rito proved that every dendrite that is not a tree admits a strongly mixing but non-exact selfmap. Since the same holds for the circle, the case of finite graphs became of interest. We generalize the result of Illanes and Rito, resolve the question for finite graphs, and establish several related results.
This is a joint work with M. Kowalewski, P. Oprocha, and B. Vejnar.
Predavanje bo 17. 10. 2025 ob 14:00 v predavalnici 01/20.