We study the computational problem of rigorously describing the asymptotic behavior of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit, both as a spatial object (attractor set) and as a statistical distribution (physical measure), and we prove upper bounds on the computational resources of computing descriptions of these objects with arbitrary accuracy. We also study how these bounds are affected by different dynamical constraints and provide several examples showing that our bounds are sharp in general. In particular, we exhibit a computable interval map having a unique transitive attractor with Cantor set structure supporting a unique physical measure such that both the attractor and the measure are non-computable.

Many continua that admit a transitive homeomorphism may be found in the literature. The circle is probably the simplest non-degenerate continuum that admits such a homeomorphism. However, most of the known examples of such continua have a complicated topological structure. For example, they are indecomposable (such as the pseudo-arc or the Knaster bucket-handle continuum), or they are not indecomposable but have some other complicated topological structure, such as a dense set of ramification points (such as the Sierpiński carpet) or a dense set of end-points (such as the Lelek fan). In this paper, we continue our mission of finding continua with simpler topological structures that admit a transitive homeomorphism. We construct a transitive homeomorphism on the Cantor fan. In our approach, we use two different techniques, each of them giving two constructions of a transitive homeomorphism on the Cantor fan: one technique using quotient spaces of products of compact metric spaces and Cantor sets, and one using Mahavier products of closed relations on compact metric spaces. We also demonstrate how our technique using Mahavier products of closed relations may be used to construct a transitive function f on a Cantor fan X such that $\varprojlim (X,f)$ is a Lelek fan.

We establish sufficient and necessary conditions for the joint transitivity of linear iterates in a minimal topological dynamical system with commuting transformations. This result provides the first topological analogue of the classical Berend and Bergelson joint ergodicity criterion in measure-preserving systems.

We study piecewise injective, but not necessarily globally injective, contracting maps on a compact subset of ${\mathbb R}^d$. We prove that, generically, the attractor and the set of discontinuities of such a map are disjoint, and hence the attractor consists of periodic orbits. In addition, we prove that piecewise injective contractions are generically topologically stable.

Using tools from computable analysis, we develop a notion of effectiveness for general dynamical systems as those group actions on arbitrary spaces that contain a computable representative in their topological conjugacy class. Most natural systems one can think of are effective in this sense, including some group rotations, affine actions on the torus and finitely presented algebraic actions. We show that for finitely generated and recursively presented groups, every effective dynamical system is the topological factor of a computable action on an effectively closed subset of the Cantor space. We then apply this result to extend the simulation results available in the literature beyond zero-dimensional spaces. In particular, we show that for a large class of groups, many of these natural actions are topological factors of subshifts of finite type.

We introduce the notions of returns and well-aligned sets for closed relations on compact metric spaces and then use them to obtain non-trivial sufficient conditions for such a relation to have non-zero entropy. In addition, we give a characterization of finite relations with non-zero entropy in terms of Li–Yorke and DC2 chaos.

We define the topological multiplicity of an invertible topological system $(X,T)$ as the minimal number k of real continuous functions $f_1,\ldots , f_k$ such that the functions $f_i\circ T^n$, $n\in {\mathbb {Z}}$, $1\leq i\leq k,$ span a dense linear vector space in the space of real continuous functions on X endowed with the supremum norm. We study some properties of topological systems with finite multiplicity. After giving some examples, we investigate the multiplicity of subshifts with linear growth complexity.

We characterize the stabilized automorphism group for odometers and Toeplitz subshifts, and then prove an invariance property of the stabilized automorphism group of these dynamical systems. Namely, we prove the isomorphism invariance of the primes for which the p-adic valuation of the period structure tends to infinity. A particular case of interest is that for torsion-free odometers, the stabilized automorphism group is a full isomorphism invariant.

In this paper, we prove the continuity of iteration operators $\mathcal {J}_n$ on the space of all continuous self-maps of a locally compact Hausdorff space X and generally discuss dynamical behaviors of them. We characterize their fixed points and periodic points for $X=\mathbb {R}$ and the unit circle $S^1$. Then we indicate that all orbits of $\mathcal {J}_n$ are bounded; however, we prove that for $X=\mathbb {R}$ and $S^1$, every fixed point of $\mathcal {J}_n$ which is non-constant and equals the identity on its range is not Lyapunov stable. The boundedness and the instability exhibit the complexity of the system, but we show that the complicated behavior is not Devaney chaotic. We give a sufficient condition to classify the systems generated by iteration operators up to topological conjugacy.

As a weak version of embedding flow, the problem of iterative roots is studied extensively in one dimension, especially in monotone case. There are few results in high dimensions because the constructive method dealing with monotone mappings is unavailable. In this paper, by introducing a kind of partial order, we define the monotonicity for two-dimensional mappings and then present some results on the existence of iterative roots for linear mappings, triangle-type mappings, and co-triangle-type mappings, respectively. Our theorems show that even the property of monotonicity for iterative roots of monotone mappings, which is a trivial result in one dimension, does not hold anymore in high dimensions. At the end of this paper, the problem of iterative roots for two well-known planar mappings, that is, Hénon mappings and coupled logistic mappings, are also discussed.

An iterative square root of a self-map f is a self-map g such that $g(g(\cdot ))=f(\cdot )$ . We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. They are used to prove that continuous self-maps with no square roots are dense in the space of all continuous self-maps for various topological spaces. The spaces studied include those that are homeomorphic to the unit cube in ${\mathbb R}^{m}$ and to the whole of $\mathbb {R}^{m}$ for every positive integer $m.$ However, we also prove that every continuous self-map on a space homeomorphic to the unit cube in $\mathbb {R}^{m}$ with a fixed point on the boundary can be approximated by iterative squares of continuous self-maps.

We construct the complete set of orders of growth and define on it the generalized entropy of a dynamical system. With this object, we provide a framework wherein we can study the separation of orbits of a map beyond the scope of exponential growth. We show that this construction is particularly useful for studying families of dynamical systems with vanishing entropy. Moreover, we see that the space of orders of growth in which orbits are separated is wilder than expected. We achieve this with different types of examples.

We introduce some notions of conditional mean dimension for a factor map between two topological dynamical systems and discuss their properties. With the help of these notions, we obtain an inequality to estimate the mean dimension of an extension system. The conditional mean dimension for G-extensions is computed. We also exhibit some applications in dynamical embedding problems.