Related papers: Realizing ergodic properties in zero entropy subsh…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. For a wide class of intrinsically ergodic subshifts over a finite alphabet, we show that the space of…

The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…

Consider a subshift over a finite alphabet, $X\subset \Lambda^{\mathbb Z}$ (or $X\subset\Lambda^{\mathbb N_0}$). With each finite block $B\in\Lambda^k$ appearing in $X$ we associate the empirical measure ascribing to every block…

In this article, we pay attention to transitive dynamical systems having the shadowing property and the entropy functions are upper semicontinuous. As for these dynamical systems, when we consider ergodic optimization restricted on the…

We study approximation schemes for shift spaces over a finite alphabet using (pseudo)metrics connected to Ornstein's $\bar{d}$ metric. This leads to a class of shift spaces we call $\bar{d}$-approachable. A shift space…

We consider skew-products with concave interval fiber maps over a certain subshift obtained as the projection of orbits staying in a given region. It generates a new type of (essentially) coded shift. The fiber maps have expanding and…

We prove that a shift ergodic measure on a topologically mixing sub-shift is isomorphic to a Bernoulli shift whenever it is quasi invariant under permutations of finite number of coordinates. We prove also that Gibbs measures on…

Ergodic optimization aims to describe dynamically invariant probability measures that maximize the integral of a given function. The Dyck and Motzkin shifts are well-known examples of transitive subshifts over a finite alphabet that are not…

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…

Ergodic optimization aims to single out dynamically invariant Borel probability measures which maximize the integral of a given "performance" function. For a continuous self-map of a compact metric space and a dense set of continuous…

Given an irreducible subshift of finite type X, a subshift Y, a factor map \pi : X \to Y, and an ergodic invariant measure \nu on Y, there can exist more than one ergodic measure on X which projects to \nu and has maximal entropy among all…

In 1984 Boshernitzan proved an upper bound on the number of ergodic measures for a minimal subshift of linear block growth and asked if it could be lowered without further assumptions on the shift. We answer this question, showing that…

Based on previous work of the authors, to any $S$-adic development of a subshift $X$ a "directive sequence" of commutative diagrams is associated, which consists at every level $n \geq 0$ of the measure cone and the letter frequency cone of…

We study the measure theoretic properties of typical C 0 maps of the interval. We prove that any ergodic measure is pseudo-physical, and conversely, any pseudo-physical measure is in the closure of the ergodic measures, as well as in the…

We construct ergodic probability measures with infinite metric entropy for typical continuous maps and homeomorphisms on compact manifolds. We also construct sequences of such measures that converge to a zero-entropy measure.

In this paper we study ergodic theory of countable Markov shifts. These are dynamical systems defined over non-compact spaces. Our main result relates the escape of mass, the measure theoretic entropy, and the entropy at infinity of the…

For dynamical systems with the shadowing property, we provide a method of approximation of invariant measures by ergodic measures supported on odometers and their almost 1-1 extensions. For a topologically transitive system with the…

In this paper it is proved that if a minimal system has the property that its sequence entropy is uniformly bounded for all sequences, then it has only finitely many ergodic measures and is an almost finite to one extension of its maximal…

We resolve a long-standing open question on the relationship between measure-theoretic dynamical complexity and symbolic complexity by establishing the exact word complexity at which measure-theoretic strong mixing manifests: For every…

Subshifts of deterministic substitutions are ubiquitous objects in dynamical systems and aperiodic order (the mathematical theory of quasicrystals). Two of their most striking features are that they have low complexity (zero topological…