English
Related papers

Related papers: Perturbing Subshifts of Finite Type

200 papers

In this paper, we consider different classes of subshifts and study their perturbations obtained by forbidding sequences that contain a given word as a subword. We show that the perturbations of sofic shifts are sofic. Though not true for…

Dynamical Systems · Mathematics 2025-06-27 Haritha Cheriyath

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…

Probability · Mathematics 2012-04-09 Kevin McGoff

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

Dynamical Systems · Mathematics 2023-02-21 Robert Bland , Kevin McGoff , Ronnie Pavlov

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…

Dynamical Systems · Mathematics 2025-11-07 Sebastián Barbieri

We bound the change in entropy incurred by an irreducible subshift of finite type upon perturbing it by forbidding a pair of admissible words. Lind has proven such bounds in the one-word case, and we adapt his methods. In particular, we…

Dynamical Systems · Mathematics 2019-02-12 Nick Ramsey

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…

Dynamical Systems · Mathematics 2014-08-19 Kevin McGoff , Ronnie Pavlov

In this paper, we explore the construction and dynamical properties of $\mathcal{S}$-limited shifts. An $S$-limited shift is a subshift defined on a finite alphabet $\mathcal{A} = \{1, \ldots,p\}$ by a set $\mathcal{S} = \{S_1, \ldots,…

Dynamical Systems · Mathematics 2017-08-30 Benjamin Matson , Elizabeth Sattler

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…

Dynamical Systems · Mathematics 2011-10-28 Dawoud Ahmadi Dastjerdi , Maliheh Dabbaghian Amiri

We define a notion of rank for words and subshifts that we call spacer rank, extending the notion of rank-one symbolic shifts of Gao and Hill. We construct infinite words of each finite spacer rank, of unbounded spacer rank, and show there…

Dynamical Systems · Mathematics 2024-06-27 Su Gao , Liza Jacoby , William Johnson , James Leng , Ruiwen Li , Cesar E. Silva , Yuxin Wu

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ if there is no factor $f$ of $w$ such that $f= (p)$ where $h: \Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern…

Discrete Mathematics · Computer Science 2013-01-10 Pascal Ochem , Alexandre Pinlou

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

Dynamical Systems · Mathematics 2014-09-23 Michael Hochman , Tom Meyerovitch

In this work, we treat subshifts, defined in terms of an alphabet $A$ and (usually infinite) forbidden list $F$, where the number of $n$-letter words in $F$ has "slow growth rate" in $n$. We show that such subshifts are well-behaved in…

Dynamical Systems · Mathematics 2023-06-22 Ronnie Pavlov

For any $d \geq 1$, random $\mathbb{Z}^d$ shifts of finite type (SFTs) were defined in previous work of the authors. For a parameter $\alpha \in [0,1]$, an alphabet $\mathcal{A}$, and a scale $n \in \mathbb{N}$, one obtains a distribution…

Dynamical Systems · Mathematics 2017-05-02 Kevin McGoff , Ronnie Pavlov

Let $G=\left\langle S|R_{A}\right\rangle $ be a semigroup with generating set $ S$ and equivalences $R_{A}$ among $S$ determined by a matrix $A$. This paper investigates the complexity of $G$-shift spaces by yielding the topological…

Dynamical Systems · Mathematics 2018-08-16 J. C. Ban , C. H. Chang , Y. Z. Huang

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…

Dynamical Systems · Mathematics 2018-09-18 Kevin McGoff

Any coded subshift X defined by a set C of code words contains a subshift, which we call L, consisting of limits of single code words. We show that when C satisfies a unique decomposition property, the topological entropy h(X) of X is…

Dynamical Systems · Mathematics 2018-03-19 Ronnie Pavlov

We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form $x \overline{x}$), and we completely classify which possibilities can occur. We consider…

Formal Languages and Automata Theory · Computer Science 2019-04-22 Tim Ng , Pascal Ochem , Narad Rampersad , Jeffrey Shallit

Consider a compact metric space $X$, and let $\mathcal{F}=\{f_1,\,f_2,\ldots,\, f_k\}$ be a set of contracting and continuous self maps on $X$. Let $\Sigma$ be a sub-shift on $k$ symbols, and let $\Sigma_k$ be the full shift. Define…

Dynamical Systems · Mathematics 2024-06-25 Dawoud Ahmadi Dastjerdi , Sedigheh Darsaraee

In this paper we study the directions of periodicity of three-dimensional subshifts of finite type (SFTs) and in particular their slopes. A configuration of a subshift has a slope of periodicity if it is periodic in exactly one direction,…

Discrete Mathematics · Computer Science 2018-06-20 Etienne Moutot , Pascal Vanier

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…

Dynamical Systems · Mathematics 2013-07-23 D. Ahmadi Dastjerdi , S. Jangjoo
‹ Prev 1 2 3 10 Next ›