Related papers: Encoding subshifts through sliding block codes

For an aperiodic subshift of finite type $Y$ and for a subshift $X$ with topological entropy less than the topological entropy of $Y$, a theorem is proved in Krieger: On the subsystems of topological Markov chains, Ergodic Theory \&…

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 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 factor code between sofic shifts X and Y, there is a family of decompositions of the original code into factor codes such that the entropies of the intermediate subshifts arising from the decompositions are dense in the interval…

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…

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…

It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that…

Generalizing a result of MacDonald we give necessary and sufficient conditions for an arbitrary subshift to embed into an irreducible sofic shift factoring through a given cover by an irreducible subshift of finite type (SFT). We obtain…

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)…

Let $Z$ be an affine algebraic variety and $X$ be a smooth flexible variety. We develop some criteria under which $Z$ admits a closed embedding into $X$. In particular, we show that if $X$ is isomorphic (as an algebraic variety) to a…

We present shuffle coding, a general method for optimal compression of sequences of unordered objects using bits-back coding. Data structures that can be compressed using shuffle coding include multisets, graphs, hypergraphs, and others. We…

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…

A coloration w of Z^2 is said to be coverable if there exists a rectangular block q such that w is covered with occurrences of q, possibly overlapping. In this case, q is a cover of w. A subshift is said to have the cover q if each of its…

We consider entanglement through permeable interfaces in the c=1 (1+1)-dimensional conformal field theory. We compute the partition functions with the interfaces inserted. By the replica trick, the entanglement entropy is obtained…

We study the difficulty of computing topological entropy of subshifts subjected to mixing restrictions. This problem is well-studied for multidimensional subshifts of finite type : there exists a threshold in the irreducibility rate where…

We study the decoding transition for quantum error correcting codes with the help of a mapping to random-bond Wegner spin models. Families of quantum low density parity-check (LDPC) codes with a finite decoding threshold lead to both known…

Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomposition property, the topological entropy h(X) of X is…

Let S be an ergodic measure-preserving automorphism on a non-atomic probability space, and let T be the time-one map of a topologically weak mixing suspension flow over an irreducible subshift of finite type under a Holder ceiling function.…

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…