Related papers: S-limited shifts

This paper is a systematic study about the syndetically proximal relation and the possible existence of syndetically scrambled sets for the dynamics of continuous self-maps of compact metric spaces. Especially we consider various classes of…

This paper studies several aspects of symbolic ({\em i.e.}\ subshift) factors of $\mathcal{S}$-adic subshifts of finite alphabet rank. First, we address a problem raised in [DDPM20] about the topological rank of symbolic factors of…

We define a morphic subshift as a subshift generated by the image of a substitution subshift by another substitution. In other words, it is the subshift associated with a ultimately periodic directive sequence. We present an efficient…

An idea that became unavoidable to study zero entropy symbolic dynamics is that the dynamical properties of a system induce in it a combinatorial structure. An old problem addressing this intuition is finding a structure theorem for…

Measure-theoretic slow entropy is a more refined invariant than the classical measure-theoretic entropy to characterize the complexity of dynamical systems with subexponential growth rates of distinguishable orbit types. In this paper we…

The chaotic properties of some subshift maps are investigated. These subshifts are the orbit closures of certain non-periodic recurrent points of a shift map. We first provide a review of basic concepts for dynamics of continuous maps in…

In this paper we calculate the metric and folding entropies for a family of non-invertible symbolic dynamical systems $(\Sigma_{m_-,m_+}, \sigma_\phi)$ which generalizes the standard bilateral Bernoulli shifts. The space $\Sigma_{m_-,m_+}$…

A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…

In this paper, we introduce the concept of S-expansiveness for local homeomorphisms and demonstrate that a class of extended symbolic dynamics, known as zip shift maps, are S-expansive and possess the shadowing property. Furthermore, we…

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…

We consider continuous, translation-commuting transformations of compact, translation-invariant families of mappingsfrom finitely generated groups into finite alphabets. It is well-known that such transformations and spaces can be described…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

Ott, Tomforde, and Willis proposed a useful compactification for one-sided shifts over infinite alphabets. Building from their idea we develop a notion of two-sided shift spaces over infinite alphabets, with an eye towards generalizing a…

In this work we characterize those shift spaces which can support a 1-block quasi-group operation and show the analogous of Kitchens result: any such shift is conjugated to a product of a full shift with a finite shift. Moreover, we prove…

It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…

Positive topological entropy and distributional chaos are characterized for hereditary shifts. A hereditary shift has positive topological entropy if and only if it is DC2-chaotic (or equivalently, DC3-chaotic) if and only if it is not…

For a mixing shift of finite type, the associated automorphism group has a rich algebraic structure, and yet we have few criteria to distinguish when two such groups are isomorphic. We introduce a stabilization of the automorphism group,…

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…

We introduce the forward limit set $\Lambda$ of a semigroup $S$ generated by a family of substitutions of a finite alphabet, which typically coincides with the set of all possible s-adic limits of that family. We provide several alternative…

Let $X$ be a $2$-dimensional subshift of finite type generated by a finite set of forbidden blocks (of finite size). We give an algorithm for generating the elements of the shift space using sequence of finite matrices (of increasing size).…