相关论文: Brudno's theorem for Z^d (or Z^d_+) subshifts

It was proved by Brudno that entropy and Kolmogorov complexity for dynamical systems are tightly related. We generalize his results to the case of arbitrary computable amenable group actions. Namely, for an ergodic shift-action, the…

A theorem of A.A. Brudno says that the Kolmogorov-Sinai entropy of a subshift X over $\mathbb{N}$ with respect to an ergodic measure $\mu$ equals the asymptotic Kolmogorov complexity of almost every word $\omega$ in X. The purpose of this…

We show that in the category of effective $Z$ dynamical systems there is a universal system, i.e. one that factors onto every other effective system. In particular, for d $\geq 3$ there exist d-dimensional shifts of finite type which are…

The Kolmogorov-Sinai entropy in the sense of Tsallis under Bernoulli shifts was obtained by Meson and Vericat [J. Math. Phys. 37, 4480(1996)]. In this paper, we propose a revised generalized Kolmogorov-Sinai-q entropy under Markov shifts.…

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

It is well-known that any $\mathbb{Z}$ subshift with the specification property has the property that every factor is intrinsically ergodic, i.e., every factor has a unique factor of maximal entropy. In recent work, other $\mathbb{Z}$…

In classical information theory, entropy rate and Kolmogorov complexity per symbol are related by a theorem of Brudno. In this paper, we prove a quantum version of this theorem, connecting the von Neumann entropy rate and two notions of…

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 study ergodic-theoretic properties of coded shift spaces. A coded shift space is defined as a closure of all bi-infinite concatenations of words from a fixed countable generating set. We derive sufficient conditions for the uniqueness of…

For dynamical systems satisfying the approximate $\mathbb{Z}^{d}$ or $\mathbb{Z}_+^{d}$-product property and asymptotically entropy expansiveness, we establish a precise description of the structure of their space of invariant measures. In…

This paper defines and discusses the dimension notion of topological slow entropy of any subset for Z^d actions. Also, the notion of measure-theoretic slow entropy for Z^d actions is presented, which is modified from Brin and Katok [2].…

The problem of positive Kolmogorov-Sinai entropy of the Chirikov-Standard map with respect to the invariant Lebesgue measure on the two-dimensional is open. In 1999, we believed to have a proof that the entropy can be bounded below. This…

The notion of slow entropy, both upper and lower slow entropy, was defined by Katok and Thouvenot as a more refined measure of complexity for dynamical systems, than the classical Kolmogorov-Sinai entropy. For any subexponential rate…

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…

A generalization of the double commutator lemma for normal subgroups is shown for invariant random subgroups of a countable group acting faithfully on a Hausdorff space. As an application, we classify ergodic invariant random subgroups of…

We prove that if a free ergodic action of a countably infinite group has positive Rokhlin entropy (or, less generally, positive sofic entropy) then it factors onto all Bernoulli shifts of lesser or equal entropy. This extends to all…

From the analyticity properties of the equation governing infinitesimal perturbations, it is shown that all stability properties of spatially extended 1D systems can be derived from a single function that we call entropy potential since it…

Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…

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…

In the case of ergodicity much of the structure of a one-dimensional time-discrete dynamical system is already determined by its ordinal structure. We generally discuss this phenomenon by considering the distribution of ordinal patterns,…