In this paper we show that generic continuous Lebesgue measure preserving circle maps have the s-limit shadowing property. In addition we obtain that s-limit shadowing is a generic property also for continuous circle maps. In particular, this implies that classical shadowing, periodic shadowing and limit shadowing are generic in these two settings as well.

Jozef Bobok Jernej Činč Piotr Oprocha Serge Troubetzkoy

In this paper we provide a detailed topological and measure-theoretic study of Lebesgue measure-preserving circle maps that are rotated with inner and outer rotations which are independent of each other. In particular, we analyze the stability of the locally eventually onto and measure-theoretic mixing properties.

Jozef Bobok Jernej Činč Piotr Oprocha Serge Troubetzkoy

In the present note we focus on dynamics on the Gehman dendrite $\mathcal{G}$. It is well-known that the set of its endpoints is homeomorphic to a standard Cantor ternary set. For any given surjective Cantor system $\mathcal{C}$ we provide constructions of (i) a mixing but not exact and (ii) an exact map on $\mathcal{G}$, such that in both cases the subsystem formed by $\text{End}(\mathcal{G})$ is conjugate to the initially chosen system on $\mathcal{C}$.

Piotr Oprocha Jakub Tomaszewski

The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a compact metric space. The theorem stating that a weakly mixing and strongly transitive system is $\Delta$-transitive is extended to a non-invertible case with a simple proof. Two examples are constructed, answering the questions posed by Moothathu [Colloq. Math. 120 (2010), no. 1, 127--138]. The first one is a multi-transitive non weakly mixing system, and the second one is a weakly mixing non multi-transitive system. The examples are special spacing shifts. The later shows that the assumption of minimality in the Multiple Recurrence Theorem can not be replaced by weak mixing.

Dominik Kwietniak Piotr Oprocha

We study relations between transitivity, mixing and periodic points on dendrites. We prove that when there is a point with dense orbit which is not an endpoint, then periodic points are dense and there is a terminal periodic decomposition (we provide an example of a dynamical system on a dendrite with dense endpoints satisfying this assumption). We also show that it may happen that all periodic points except one (and points with dense orbit) are contained in the (dense) set of endpoints. It may also happen that dynamical system is transitive but there is a unique periodic point, which in fact is the unique fixed point. We also prove that on almost meshed-continua (a class of continua containing topological graphs and dendrites with closed or countable set of endpoints), periodic points are dense if and only if they are dense for the map induced on the hyperspace of all nonempty compact subsets.

Gerardo Acosta Rodrigo Hernández-Gutiérrez Issam Naghmouchi Piotr Oprocha

In this paper, we study dynamics of maps on quasi-graphs characterizing their invariant measures. In particular, we prove that every invariant measure of quasi-graph map with zero topological entropy has discrete spectrum. Additionally, we obtain an analog of Llibre-Misiurewicz's result relating positive topological entropy with existence of topological horseshoes. We also study dynamics on dendrites and show that if a continuous map on a dendrite, whose set of all endpoints is closed and has only finitely many accumulation points, has zero topological entropy, then every invariant measure supported on an orbit closure has discrete spectrum.

Jian Li Piotr Oprocha Guohua Zhang

Let $\mathcal{P}_G$ be the family of all topologically mixing, but not exact self-maps of a topological graph $G$. It is proved that the infimum of topological entropies of maps from $\mathcal{P}_G$ is bounded from below by $(\log 3/ \Lambda(G))$, where $\Lambda(G)$ is a constant depending on the combinatorial structure of $G$. The exact value of the infimum on $\mathcal{P}_G$ is calculated for some families of graphs. The main tool is a refined version of the structure theorem for mixing graph maps. It also yields new proofs of some known results, including Blokh's theorem (topological mixing implies specification property for maps on graphs).

Grzegorz Harańczyk Dominik Kwietniak Piotr Oprocha

The main aim of the present paper is to study relations between $n$-scrambled tuples and their attraction-adherence properties with respect to various sequences of integers. This extends previous research on relations between chaos in the sense of Li and Yorke and distributional chaos with respect to a given sequence. Moreover, we construct a system which is $n$-distributionally chaotic but not $(n+1)$-chaotic.

Jian Li Piotr Oprocha

In this paper we study relations between almost specification property, asymptotic average shadowing property and average shadowing property for dynamical systems on compact metric spaces. We show implications between these properties and relate them to other important notions such as shadowing, transitivity, invariant measures, etc. We provide examples that compactness is a necessary condition for these implications to hold. As a consequence of our methodology we also obtain a proof that limit shadowing in chain transitive systems implies shadowing.

Marcin Kulczycki Dominik Kwietniak Piotr Oprocha

We show that for a non-trivial transitive dynamical system, it has a dense Mycielski invariant strongly scrambled set if and only if it has a fixed point, and it has a dense Mycielski invariant $\delta$-scrambled set for some $\delta>0$ if and only if it has a fixed point and not uniformly rigid. We also provide two methods for the construction of completely scrambled systems which are weakly mixing, proximal and uniformly rigid.

Magdalena Foryś Wen Huang Jian Li Piotr Oprocha