Related papers: On the subsystems of certain sofic shifts

Krieger's embedding theorem provides necessary and sufficient conditions for an arbitrary subshift to embed in a given topologically mixing $\mathbb{Z}$-subshift of finite type. For some $\mathbb{Z}^d$-subshifts of finite type, Lightwood…

We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…

We prove a generalization of Krieger's embedding theorem, in the spirit of zero-error information theory. Specifically, given a mixing shift of finite type $X$, a mixing sofic shift $Y$, and a surjective sliding block code $\pi: X \to Y$,…

The Krieger generator theorem says that every invertible ergodic measure-preserving system with finite measure-theoretic entropy can be embedded into a full shift with strictly greater topological entropy. We extend Krieger's theorem to…

We show that a synchronized coded system $X$ is intrinsically ergodic of full support if and only if $ h(Y)$, the topological entropy of $Y$, is less than $h(X) $ whenever $Y$ is a proper subsystem of $ X $. We also show that like systems…

The purpose of this work is to bound sofic topological entropy of Toeplitz systems over residually finite groups and to prove the Krieger Theorem about attaining arbitrary entropy by the Toeplitz systems. To achieve these results, we…

Let $\Sigma$ and $\bar\Sigma$ be finite alphabets. For topologically transitive sofic systems $ X\subset \Sigma^{\Bbb Z}$ and $\widetilde X\subset \widetilde\Sigma^{\Bbb Z}$ we give a necessary and sufficient condition for the existence of…

In this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

We investigate uniform ergodic type theorems for additive and subadditive functions on a subshift over a finite alphabet. We show that every strictly ergodic subshift admits a uniform ergodic theorem for Banach-space-valued additive…

We prove a Krieger like embedding theorem for asymptotically expansive systems with the small boundary property. We show that such a system $(X; T)$ embeds in the $K$-full shift with $h_{top}(T) < \log K $ and $\sharp Per_n(X; T) \leq…

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

We give a survey of the entropy theory of interval maps as it can be analyzed using ergodic theory, especially measures of maximum entropy and periodic points. The main tools are (i) a version of Hofbauer's Markov diagram, (ii) the…

This note revisits the problem of finding necessary and sufficient conditions for a subshift to have a continuous g-function. Results obtained by Krieger (IMS Lecture Notes-Monograph Series, 48, 306--316, 2006) on finite alphabet subshifts…

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 this work we introduce the notion of weak quasigroups, that are quasigroup operations defined almost everywhere on some set. Then we prove that the topological entropy and the ergodic period of an invertible expansive ergodically…

In this paper, we compute categorical entropy of spherical twists. In particular, we prove that Gromov-Yomdin type conjecture holds for spherical twists. Moreover, we construct counterexamples of Gromov-Yomdin type conjecture for K3…

The aim of this note is to present an elementary proof of a variation of Harris' ergodic theorem of Markov chains. This theorem, dating back to the fifties essentially states that a Markov chain is uniquely ergodic if it admits a ``small''…

Using elementary methods, we prove that for a countable Markov chain $P$ of ergodic degree $d > 0$ the rate of convergence towards the stationary distribution is subgeometric of order $n^{-d}$, provided the initial distribution satisfies…

We state and prove a generalization of Kingman's ergodic theorem on a measure-preserving dynamical system $(X,\mathcal{F},\mu,T)$ where the $\mu$-almost sure subadditivity condition $f_{n+m} \leq f_n + f_m \circ T^{n}$ is relaxed to a…

A necessary and sufficient condition is given for the existence of an embedding of an irreducible subshift of finite type into the Fibonacci-Dyck shift