相关论文: Factor maps and embeddings for random $\mathbb{Z}^…

In this work we consider an ensemble of random $\mathbb{Z}^d$-shifts of finite type ($\mathbb{Z}^d$-SFTs) and prove several results concerning the behavior of typical systems with respect to emptiness, entropy, and periodic points. These…

Let $X$ be an irreducible shift of finite type (SFT) of positive entropy, and let $B_n(X)$ be its set of words of length $n$. Define a random subset $\omega$ of $B_n(X)$ by independently choosing each word from $B_n(X)$ with some…

For each $n, d \in \mathbb{N}$ and $0 < \alpha < 1$, we define a random subset of $\mathcal{A}^{\{1, 2, \dots, n\}^d}$ by independently including each element with probability $\alpha$ and excluding it with probability $1-\alpha$, and…

We discuss some numerical invariants of multidimensional shifts of finite type (SFTs) which are associated with the growth rates of the number of admissible finite configurations. Extending an unpublished example of Tsirelson, we show 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…

Let $A$ be an $n \times n$ random matrix with iid entries over a finite field of order $q$. Suppose that the entries do not take values in any additive coset of the field with probability greater than $1 - \alpha$ for some fixed $0 < \alpha…

In this work we consider several aspects of the thermodynamic formalism in a randomized setting. Let $X$ be a non-trivial mixing shift of finite type, and let $f : X \to \mathbb{R}$ be a H\"older continuous potential with associated Gibbs…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Let $S=\{s_i\in\mathbb N\cup\{0\}:0\leq s_i<s_{i+1}\}$ and let $d_{0}=s_{0}$ and $\Delta(S)=\{d_{n}\}_{n}$ where $d_{n}=s_{n}-s_{n-1}$. In this note, we show that an $S$-gap shift is subshift of finite type (SFT) if and only if $S$ is…

In this paper, we provide an effective method to compute the topological entropies of $G$-subshifts of finite type ($G$-SFTs) with $G=F_{d}$ and $S_{d}$, the free group and free semigroup with $d$ generators respectively. We develop the…

The main aim of this article is to show that maps with specification property have invariant distributionally scrambled sets and that this kind of scrambled set can be transferred from factor to extension under finite-to-one factor maps.…

For any fixed alphabet A, the maximum topological entropy of a Z^d subshift with alphabet A is obviously log |A|. We study the class of nearest neighbor Z^d shifts of finite type which have topological entropy very close to this maximum,…

We investigate here the hardness of conjugacy and factorization of subshifts of finite type (SFTs) in dimension $d>1$. In particular, we prove that the factorization problem is $\Sigma^0_3$-complete and the conjugacy problem…

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

We study topological factors of rank-one subshifts and prove that those factors that are themselves subshifts are either finite or isomorphic to the original rank-one subshifts. Thus, we completely characterize the subshift factors of…

Given an SFT $\Sigma$ and a finite set $S$ of finite words, let $\Sigma\langle S\rangle$ denote the subshift of $\Sigma$ that avoids $S$. We establish a general criterion under which we can bound the entropy perturbation…

The aim of this article is to find appropriate definitions for shifts of finite type and sofic shifts in a general context of symbolic dynamics. We start showing that the classical definitions of shifts of finite type and sofic shifts, as…

We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…

We consider the set of finite random words $\mathcal A^\star$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $\mathcal A^\star$,…