We give a few examples of substitutions on infinite alphabets, and the beginning of a general theory of the associated dynamical systems. In particular, the “drunken man” substitution can be associated to an ergodic infinite measure preserving system, of Krengel entropy zero, while substitutions of constant length with a positive recurrent infinite matrix correspond to ergodic finite measure preserving systems.
We consider S-unimodal Misiurewicz maps T with a flat critical point c and show that they exhibit ergodic properties analogous to those of interval maps with indifferent fixed (or periodic) points. Specifically, there is a conservative ergodic absolutely continuous σ-finite invariant measure μ, exact up to finite rotations, and in the infinite measure case the system is pointwise dual ergodic with many uniform and Darling-Kac sets. Determining the order of return distributions to suitable reference...
Let T be a positive linear contraction of of a σ-finite measure space (X,Σ,μ) which overlaps supports. In general, T need not be completely mixing, but it is in the following cases: (i) T is the Frobenius-Perron operator of a non-singular transformation ϕ (in which case complete mixing is equivalent to exactness of ϕ). (ii) T is a Harris recurrent operator. (iii) T is a convolution operator on a compact group. (iv) T is a convolution operator on a LCA group.
We introduce an invariant of cohomology in Bernoulli shifts, which is used to answer a question about cohomology of Hölder functions with finitary functions whose coding time is integrable. When restricted to the class of Hölder functions, this invariant even provides a criterion of cohomology.
Soit la rotation sur le cercle d’angle irrationnel , soit une marche aléatoire transiente sur . Soit et , nous étudions la convergence faible de la suite
We prove the absence of mixing for special flows built over (1) an irrational rotation and under a function whose Fourier coefficients are of order O(1/|n|), and (2) an irrational rotation (satisfying a diophantine condition) and under a function having a finite number of singularities of a logarithmic type. These results generalize two theorems of Kochergin.
We study a class of stationary finite state processes, called quasi-Markovian, including in particular the processes whose law is a Gibbs measure as defined by Bowen. We show that, if a factor with integrable coding time of a quasi-Markovian process is maximal in entropy, then this factor splits off, which means that it admits a Bernoulli shift as an independent complement. If it is not maximal in entropy, then we can find a splitting finite extension of this factor, which generalizes a theorem...
We consider subshifts arising from primitive substitutions, which are known to be uniquely ergodic dynamical systems. In order to precise this point, we introduce a symbolic notion of discrepancy. We show how the distribution of such a subshift is in part ruled by the spectrum of the incidence matrices associated with the underlying substitution. We also give some applications of these results in connection with the spectral study of substitutive dynamical systems.
A nonuniformly entropy expanding map is any ¹ map defined on a compact manifold whose ergodic measures with positive entropy have only nonnegative Lyapunov exponents. We prove that a nonuniformly entropy expanding map T with r > 1 has a symbolic extension and we give an explicit upper bound of the symbolic extension entropy in terms of the positive Lyapunov exponents by following the approach of T. Downarowicz and A. Maass [Invent. Math. 176 (2009)].
We prove that maps with on a compact surface have symbolic extensions, i.e., topological extensions which are subshifts over a finite alphabet. More precisely we give a sharp upper bound on the so-called symbolic extension entropy, which is the infimum of the topological entropies of all the symbolic extensions. This answers positively a conjecture of S. Newhouse and T. Downarowicz in dimension two and improves a previous result of the author [11].
A finite-state stationary process is called (one- or two-sided) super-K if its (one- or two-sided) super-tail field-generated by keeping track of (initial or central) symbol counts as well as of arbitrarily remote names-is trivial. We prove that for every process (α,T) which has a direct Bernoulli factor there is a generating partition β whose one-sided super-tail equals the usual one-sided tail of β. Consequently, every K-process with a direct Bernoulli factor has a one-sided super-K generator....