Related papers: Symbolic dynamics on amenable groups: the entropy …

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

In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…

Let $\Gamma $ be an infinite discrete group and $\mathsf{A}\subset \Gamma $ a nonempty finite subset. The set of permutations $\sigma $ of $\Gamma $ such that $s^{-1}\sigma (s)\in \mathsf{A}$ for every $s\in \Gamma $ can be identified with…

Symbolic dynamical theory plays an important role in the research of amenability with a countable group. Motivated by the deep results of Dougall and Sharp, we study the group extensions for topologically mixing random shifts of finite…

We show that if $G$ is a a countable amenable group with the comparison property, and $X$ is a strongly irreducible $G$-shift satisfying certain aperiodicity conditions, then $X$ factors onto the full $G$-shift over $N$ symbols, so long as…

Let $G$ be an infinite countable amenable group and let $(X,G)$ be a $G$-subshift with specification, containing a free element. We prove that $(X,G)$ is universal, i.e., has positive topological entropy and for any free ergodic $G$-action…

The automorphism group of a one dimensional shift space over a finite alphabet exhibits different types of behavior: for a large class with positive entropy, it contains a rich collection of subgroups, while for many shifts of zero entropy,…

A probability measure preserving action of a discrete amenable group $G$ is said to be dominant if it is isomorphic to a generic extension of itself. Recently, it was shown that for $G = \mathbb{Z}$, an action is dominant if and only if it…

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

For \Gamma a countable amenable group consider those actions of \Gamma as measure-preserving transformations of a standard probability space, written as {T_\gamma}_{\gamma \in \Gamma} acting on (X,{\cal F}, \mu). We say…

We introduce a new family of shift spaces --- the subordinate shifts. Using subordinate shifts we prove in an elementary way that for every nonnegative real number $t$ there is a shift space with entropy $t$.

We define a notion of entropy for an infinite family $\mathcal{C}$ of measurable sets in a probability space. We show that the mean ergodic theorem holds uniformly for $\mathcal{C}$ under every ergodic transformation if and only if…

We prove that for any infinite countable amenable group $G$, any $\epsilon > 0$ and any finite subset $K\subset G$, there exists a tiling (partition of $G$ into finite "tiles" using only finitely many "shapes"), where all the tiles are $(K;…

We study the density of periodic configurations for shift spaces defined on (the Cayley graph of) a finitely generated group. We prove that in the case of a full shift on a residually finite group and in that of a group shift space on an…

We show how geometric methods from the general theory of fractal dimensions and iterated function systems can be deployed to study symbolic dynamics in the zero entropy regime. More precisely, we establish a dimensional characterization 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…

For a large class of irreducible shift spaces $X\subset\tA^{\Z^d}$, with $\tA$ a finite alphabet, and for absolutely summable potentials $\Phi$, we prove that equilibrium measures for $\Phi$ are weak Gibbs measures. In particular, for…

Suppose $P\subseteq \mathbb{N}$ and let $(\Sigma_P,\,\sigma_P)$ be the space of a spacing shift. We show that if entropy $h_{\sigma_P}=0$ then $(\Sigma_P,\,\sigma_P)$ is proximal. Also $h_{\sigma_P}=0$ if and only if $P=\mathbb N\setminus…