Related papers: Perturbing Subshifts of Finite Type

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

We consider word complexity and topological entropy for random substitution subshifts. In contrast to previous work, we do not assume that the underlying random substitution is compatible. We show that the subshift of a primitive random…

We establish a family of uncertainty principles for finite linear combinations of Hermite functions. More precisely, we give a geometric criterion on a subset $S\subset \RR^d$ ensuring that the $L^2$-seminorm associated to $S$ is equivalent…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

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…

We consider suspension flows with continuous roof function over the full shift $\Sigma$ on a finite alphabet. For any positive entropy subshift of finite type $Y \subset \Sigma$, we explictly construct a roof function such that the…

The $S$-gap shifts have a dynamically and combinatorially rich structure. Dynamical properties of the $S$-gap shift can be related to the properties of the set $S$. This interplay is particularly interesting when $S$ is not syndetic such as…

We study two-dimensional subshifts whose horizontal trace (a.k.a. projective subdynamics) contains only points of finite support. Our main result is a classification result for such subshifts satisfying a minimality property. As…

In this paper, we study perturbation of Hilbert-Schmidt frames under structured modifications, where the perturbation takes the form of replacing finitely or infinitely many frame elements. We establish explicit criteria under which the…

In the following text for arbitrary $X$ with at least two elements, nonempty set $\Gamma$ and self-map $\varphi:\Gamma\to\Gamma$ we prove the set-theoretical entropy of generalized shift $\sigma_\varphi:X^\Gamma\to X^\Gamma$…

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

The Ising chains in a transverse magnetic field of constant strength (h=1) and with the spin interaction value \lambda are considered. In the case of infinitely long chain, exact analytical expressions are found for the second central…

Partial rigidity is a quantitative notion of recurrence and provides a global obstruction which prevents the system from being strongly mixing. A dynamical system $(X, \mathcal{X}, \mu, T)$ is partially rigid if there is a constant $\delta…

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…

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 $G$ be a group and $H\leqslant G$ a subgroup. The free extension of an $H$-subshift $X$ to $G$ is the $G$-subshift $\widetilde{X}$ whose configurations are those for which the restriction to every coset of $H$ is a configuration from…

For a subshift $(X, \sigma_X)$ and a subadditive sequence $\mathcal{F}=\{\log f_n\}_{n=1}^{\infty}$ on $X$, we study equivalent conditions for the existence of $h\in C(X)$ such that $\lim_{n\rightarrow\infty}(1/{n})\int \log f_n d \mu=\int…

We consider the sequential composite binary hypothesis testing problem in which one of the hypotheses is governed by a single distribution while the other is governed by a family of distributions whose parameters belong to a known set…

Given an irreducible sofic shift X, we show that an an irreducible SFT Y of lower entropy is a factor of X if and only if it is a factor of X by an open bi-continuing code. If these equivalent conditions hold and Y is mixing, then any code…

Suppose that $G$ is a finite group and $H$ is a subgroup of $G$. We say that $H$ is s-semipermutable in $G$ if $HG_p = G_pH$ for any Sylow $p$-subgroup $G_p$ of $G$ with $(p, |H|) = 1$. We investigate the influence of s-semipermutable…