arXiv subjects

Piotr Oprocha

Publications and source records attributed to Piotr Oprocha.

71 records · Page 4Linked to original sources

arXiv2015

When all closed subsets are recurrent?

In the paper we study relations of rigidity, equicontinuity and pointwise recurrence between a t.d.s. $(X,T)$ and the t.d.s. $(K(X),T_K)$ induced on the hyperspace $K(X)$ of all compact subsets of $X$, and provide some characterizations. Among other examples, we construct a minimal, non-equicontinuous, distal and uniformly rigid t.d.s. and a t.d.s. which has dense small periodic sets but does not have dense distal points, solving that way open questions existing in the literature.

math.DS↗

arXiv2015

Mixing properties in coded systems

We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type, has only periodic points of even period and each set of its generators consists of blocks of even length. We prove that such an example cannot be a synchronized system. We also show that a mixing coded systems has the strong property $P$.

math.DS↗

arXiv2014

On entropy of dynamical systems with almost specification

We construct a family of shift spaces with almost specification and multiple measures of maximal entropy. This answers a question from Climenhaga and Thompson [Israel J. Math. 192 (2012), no. 2, 785--817]. Elaborating on our examples we also prove that some sufficient conditions for every subshift factor of a shift space to be intrinsically ergodic given by Climenhaga and Thompson are in some sense best possible, moreover, the weak specification property neither implies intrinsic ergodicity, nor follows from almost specification. We also construct a dynamical system with the weak specification property, which does not have the almost specification property. We prove that the minimal points are dense in the support of any invariant measure of a system with the almost specification property. Furthermore, if a system with almost specification has an invariant measure with non-trivial support, then it also has uniform positive entropy over the support of any invariant measure and can not be minimal.

math.DS↗

arXiv2014

Invariant scrambled sets, uniform rigidity and weak mixing

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 $δ$-scrambled set for some $δ>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.

math.DS↗

arXiv2014

On various definitions of shadowing with average error in tracing

In this paper we present a systematic study of shadowing properties with average error in tracing such as (asymptotic) average shadowing, $\underline{d}$-shadowing, $\overline{d}$-shadowing and almost specification. As the main tools we provide a few equivalent characterizations of the average shadowing property, which also partly apply to other notions of shadowing. We prove that almost specification on the whole space induces this property on the measure center. Next, we show that always (e.g. without assumption that the map is onto) almost specification implies asymptotic average shadowing, which in turn implies the average shadowing property and consequently also $\underline{d}$-shadowing and $\overline{d}$-shadowing. Finally, we study connections among sensitivity, transitivity, equicontinuity and (average) shadowing.

math.DS↗

arXiv2014

On "observable" Li-Yorke tuples for interval maps

In this paper we study the set of Li-Yorke $d$-tuples and its $d$-dimensional Lebesgue measure for interval maps $T\colon [0,1] \to [0,1]$. If a topologically mixing $T$ preserves an absolutely continuous probability measure 9with respect to Lebesgue), then the $d$-tuples have Lebesgue full measure, but if $T$ preserves an infinite absolutely continuous measure, the situation becomes more interesting. Taking the family of Manneville-Pomeau maps as example, we show that for any $d \ge 2$, it is possible that the set of Li-Yorke $d$-tuples has full Lebesgue measure, but the set of Li-Yorke $d+1$-tuples has zero Lebesgue measure.

math.DS↗

arXiv2013

Periodic points and transitivity on dendrites

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.

math.DS↗

arXiv2013

Shadowing property, weak mixing and regular recurrence

We show that a non-wandering dynamical system with the shadowing property is either equicontinuous or has positive entropy and that in this context uniformly positive entropy is equivalent to weak mixing. We also show that weak mixing together with the shadowing property imply the specification property with a special kind of regularity in tracing (a weaker version of periodic specification property). This in turn implies that the set of ergodic measures supported on the closures of orbits of regularly recurrent points is dense in the space of all invariant measures (in particular, invariant measures in such a system form the Poulsen simplex, up to an affine homeomorphism).

math.DS↗

arXiv2013

On almost specification and average shadowing properties

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.

math.DS↗

arXiv2013

On weak product recurrence and synchronization of return times

The paper is devoted to study of product recurrence. First, we prove that notions of $\F_{ps}-PR$ and $\F_{pubd}-PR$ are exactly the same as product recurrence, completing that way results of [P. Dong, S. Shao and X. Ye, \emph{Product recurrent properties, disjointness and weak disjointness}, Israel J. Math.], and consequently, extending the characterization of return times of distal points which originated from works of Furstenberg. We also study the structure of the set of return times of weakly mixing sets. As a consequence, we obtain new sufficient conditions for $\F_{s}-PR$ and also find a short proof that weakly mixing systems are disjoint with all minimal distal systems (in particular, our proof does not involve Furstenberg's structure theorem of minimal distal systems).

math.DS↗

arXiv2013

Syndetic proximality and scrambled sets

This paper is a systematic study about the syndetically proximal relation and the possible existence of syndetically scrambled sets for the dynamics of continuous self-maps of compact metric spaces. Especially we consider various classes of transitive subshifts, interval maps, and topologically Anosov maps. We also present many constructions and examples.

math.DS↗

arXiv2012

Shadowing and Expansivity in Sub-Spaces

We address various notions of shadowing and expansivity for continuous maps restricted to a proper subset of their domain. We prove new equivalences of shadowing and expansive properties, we demonstrate under what conditions certain expanding maps have shadowing, and generalize some known results in this area. We also investigate the impact of our theory on maps of the interval, in which context some of our results can be extended.

math.DS↗

arXiv2012

Factor maps and invariant distributional chaos

The main aim of this article is to show that maps with specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps. This solves some open questions in the literature of the topic. We also show how our method can be applied in practice, taking as example Poincaré map of time-periodic nonautonomous planar differential equation $$ \dot{z}=v(t,z)=(1+e^{iκt}\abs{z}^2)\z^3 -N $$ where $κ$ and $N$ are sufficiently small positive real numbers.

math.DS↗

arXiv2012

On $n$-scrambled tuples and distributional chaos in a sequence

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.

math.DS↗

arXiv2011

Characterizations of ω-Limit Sets of Topologically Hyperbolic Systems

It is well known that ω-limit sets are internally chain transitive and have weak incompressibility; the converse is not generally true, in either case. However, it has been shown that a set is weakly incompressible if and only if it is an abstract ω-limit set, and separately that in shifts of finite type, a set is internally chain transitive if and only if it is a (regular) ω-limit set. In this paper we generalise these and other results, proving that the characterization for shifts of finite type holds in a variety of topologically hyperbolic systems (defined in terms of expansive and shadowing properties), and also show that the notions of internal chain transitivity and weak incompressibility coincide in compact metric spaces.

math.DS↗

arXiv2011

Topological structure and entropy of mixing graph maps

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/ Λ(G))$, where $Λ(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).

math.DS↗

arXiv2011

On weak mixing, minimality and weak disjointness of all iterates

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 $Δ$-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.

math.DS↗