English
Related papers

Related papers: Characterizations of periods of multidimensional s…

200 papers

Periodic-finite-type shifts (PFT's) form a class of sofic shifts that strictly contains the class of shifts of finite type (SFT's). In this paper, we investigate how the notion of "period" inherent in the definition of a PFT causes it to…

Information Theory · Computer Science 2008-04-30 Akiko Manada , Navin Kashyap

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

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…

Dynamical Systems · Mathematics 2022-03-31 Marcelo Sobottka

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

The class of periodic-finite-type shifts (PFT's) is a class of sofic shifts that strictly includes the class of shifts of finite type (SFT's), and the zeta function of a PFT is a generating function for the number of periodic sequences in…

Information Theory · Computer Science 2009-04-16 Akiko Manada , Navin Kashyap

We study multidimensional minimal and quasiperiodic shifts of finite type. We prove for these classes several results that were previously known for the shifts of finite type in general, without restriction. We show that some quasiperiodic…

Discrete Mathematics · Computer Science 2021-07-01 Bruno Durand , Andrei Romashchenko

In this paper we study the shifts, which are the shift-invariant and topologically closed sets of configurations over a finite alphabet in $\mathbb{Z}^d$. The minimal shifts are those shifts in which all configurations contain exactly the…

Discrete Mathematics · Computer Science 2017-06-27 Bruno Durand , Andrei Romashchenko

We present constructions of countable two-dimensional subshifts of finite type (SFTs) with interesting properties. Our main focus is on properties of the topological derivatives and subpattern posets of these objects. We present a countable…

Dynamical Systems · Mathematics 2013-10-03 Ville Salo , Ilkka Törmä

In this work, we prove that every SFT, sofic shift, and strongly irreducible shift on locally finite groups has strong dynamical properties. These properties include that every sofic shift is an SFT, every SFT is strongly irreducible, every…

Dynamical Systems · Mathematics 2023-05-09 Jacob Raymond

We introduce a new type of shift dynamics as an extended model of symbolic dynamics, and investigate the characteristics of shift spaces from the viewpoints of both dynamics and computation. This shift dynamics is called a functional shift…

Chaotic Dynamics · Physics 2009-11-10 Jun Namikawa , Takashi Hashimoto

We provide an example of a non-finitely generated group which admits a nonempty strongly aperiodic SFT. Furthermore, we completely characterize the groups with this property in terms of their finitely generated subgroups and the roots of…

Dynamical Systems · Mathematics 2023-07-21 Sebastián Barbieri

We explore the relationship between subgroups and the possible shifts of finite type (SFTs) that can be defined on the group. In particular, we investigate two group invariants, weak periodicity and strong periodicity, defined via symbolic…

Group Theory · Mathematics 2015-09-15 David Carroll , Andrew Penland

Subshifts are sets of colorings of $\mathbb{Z}^d$ defined by families of forbidden patterns. In a given subshift, the extender set of a finite pattern is the set of all its admissible completions. Since soficity of $\mathbb{Z}$ subshifts is…

Discrete Mathematics · Computer Science 2025-10-03 Antonin Callard , Léo Paviet Salomon , Pascal Vanier

Let $X\subset A^{Z^d}$ be a $2$-dimensional subshift of finite type. We prove that any $2$-dimensional multidimensional subshift of finite type can be characterized by a square matrix of infinite dimension. We extend our result to a general…

Dynamical Systems · Mathematics 2016-03-03 Puneet Sharma , Dileep Kumar

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

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

Computational Complexity · Computer Science 2012-08-15 Ville Salo , Ilkka Törmä

We study the parametrized complexity of fundamental relations between multidimensional subshifts, such as equality, conjugacy, inclusion, and embedding, for subshifts of finite type (SFTs) and effective subshifts. We build on previous work…

Dynamical Systems · Mathematics 2026-02-16 Nicanor Carrasco-Vargas , Benjamin Hellouin de Menibus , Rémi Pallen

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…

Combinatorics · Mathematics 2007-05-23 Ethan M. Coven , William Geller , Sylvia Silberger , William P. Thurston

As a variant of the equal entropy cover problem, we ask whether all multidimensional sofic shifts with countably many configurations have SFT covers with countably many configurations. We answer this question in the negative by presenting…

Dynamical Systems · Mathematics 2018-09-12 Ilkka Törmä

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 ›