English
Related papers

Related papers: Hierarchy and Expansiveness in Two-Dimensional Sub…

200 papers

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

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ä

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 paper we use fixed point tilings to answer a question posed by Michael Hochman and show that every one-dimensional effectively closed subshift can be implemented by a local rule in two dimensions. The proof uses the fixed-point…

Logic in Computer Science · Computer Science 2010-03-17 Bruno Durand , Andrei Romashchenko , Alexander Shen

We study two relations on multi-dimensional subshifts: A pre-order based on the patterns configurations contain and the Cantor-Bendixson rank. We exhibit several structural properties of two-dimensional subshifts: We characterize the…

Dynamical Systems · Mathematics 2013-09-25 Alexis Ballier , Emmanuel Jeandel

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…

Dynamical Systems · Mathematics 2019-02-05 Ville Salo

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 present a technique to lift some tilings of the discrete hyperbolic plane -- tilings defined by a 1D substitution -- into a zero entropy subshift of finite type (SFT) on non-abelian amenable Baumslag-Solitar groups $BS(1,n)$ for…

Dynamical Systems · Mathematics 2020-12-22 Nathalie Aubrun , Michael Schraudner

We define and study a class of subshifts of finite type (SFTs) defined by a family of allowed patterns of the same shape where, for any contents of the shape minus a corner, the number of ways to fill in the corner is the same. The main…

Dynamical Systems · Mathematics 2020-09-14 Ville Salo

We construct a nontrivial three-dimensional subshift of finite type whose projective $\Z$-subdynamics, or $\Z$-trace, is 2-sparse, meaning that there are at most two nonzero symbols in any vertical column. The subshift is deterministic in…

Dynamical Systems · Mathematics 2026-05-18 Ville Salo , Ilkka Törmä

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

Dynamical Systems · Mathematics 2019-02-06 Puneet Sharma , Dileep Kumar

In this article, we study classes of multidimensional subshifts defined by multihead finite automata, in particular the hierarchy of classes of subshifts defined as the number of heads grows. The hierarchy collapses on the third level,…

Formal Languages and Automata Theory · Computer Science 2014-08-29 Ville Salo , Ilkka Törmä

We define a pair of simple combinatorial operations on subshifts, called existential and universal extensions, and study their basic properties. We prove that the existential extension of a sofic shift by another sofic shift is always…

Dynamical Systems · Mathematics 2014-07-24 Ilkka Törmä

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

A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves,…

Formal Languages and Automata Theory · Computer Science 2019-04-26 Taylor J. Smith , Kai Salomaa

Two and three-point functions of primary fields in four dimensional CFT have a simple space-time dependences factored out from the combinatoric structure which enumerates the fields and gives their couplings. This has led to the formulation…

High Energy Physics - Theory · Physics 2022-02-22 Robert de Mello Koch , Sanjaye Ramgoolam

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

This paper presents a "two-dimensional Fourier Continuation" method (2D-FC) for construction of bi-periodic extensions of smooth non-periodic functions defined over general two-dimensional smooth domains. The approach can be directly…

Numerical Analysis · Mathematics 2020-10-19 Oscar P. Bruno , Jagabandhu Paul

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
‹ Prev 1 2 3 10 Next ›