Related papers: S-limited shifts
This paper characterises the subspaces of $H^2(\mathbb D)$ simultaneously invariant under $S^2 $ and $S^{2k+1}$, where $S$ is the unilateral shift, then further identifies the subspaces that are nearly invariant under both $(S^2)^*$ and…
In [Ergodic Theory Dynam. System, 16 (1996) 663--682], S. Ferenczi proved that any minimal subshift with first difference of complexity bounded by 2 is $S$-adic with $\card S \leq 3^{27}$. In this paper, we improve this result by giving an…
The family of symmetric one sided subshifts in two symbols given by a sequence $a$ is studied. We analyse some of their topological properties such as transitivity, the specification property and intrinsic ergodicity. It is shown that…
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…
Building on our previous work, we give a thorough presentation of the techniques developed for synchronizing dynamical systems in the special case of synchronizing shift spaces. Following work of Thomsen, we give a construction of the…
Given a factor code $\pi$ from a one-dimensional shift of finite type $X$ onto an irreducible sofic shift $Y$, if $\pi$ is finite-to-one there is an invariant called the degree of $\pi$ which is defined the number of preimages of a typical…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…
The notion of entropy dimension has been introduced to measure the subexponential complexity of zero entropy systems. In this work we present a general construction of a strictly ergodic subshift of topological entropy dimension $\alpha$…
Recently a generalization of shifts of finite type to the infinite alphabet case was proposed, in connection with the theory of ultragraph C*-algebras. In this work we characterize the class of continuous shift commuting maps between these…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
It is shown that for a bounded weighted bilateral shift $T$ acting on $\ell_p(\Z)$ for $1\leq p\leq 2$ supercyclicity of $T$, weak supercyclicity of $T$, cyclicity of $T\oplus T$ and cyclicity of $T^2$ are equivalent. A new sufficient…
This paper studies geometric and spectral properties of $S$-adic shifts and their relation to continued fraction algorithms. These shifts are symbolic dynamical systems obtained by iterating infinitely many substitutions. Pure discrete…
In this note we study the structure of shift-preserving operators acting on a finitely generated shift-invariant space. We define a new notion of diagonalization for these operators, which we call s-diagonalization. We give necessary and…
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,…
Systems obtained by quotienting a subshift of finite type (SFT) by another SFT are called finitely presented in the literature. Analogously, if a sofic shift is quotiented by a sofic equivalence relation, we call the resulting system…
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}$…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
We investigate generic properties (i.e. properties corresponding to residual sets) in the space of subshifts with the Hausdorff metric. Our results deal with four spaces: the space $\mathbf{S}$ of all subshifts, the space…