English
Related papers

Related papers: Structuring multi-dimensional subshifts

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ä

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

Using a deterministic version of the self-similar (or hierarchical, or fixed-point ) method for constructing 2-dimensional subshifts of finite type (SFTs), we construct aperiodic 2D SFTs with a unique direction of non-expansiveness and…

Dynamical Systems · Mathematics 2016-03-18 Charalampos Zinoviadis

In this paper, we study the structure of the set of tilings produced by any given tile-set. For better understanding this structure, we address the set of finite patterns that each tiling contains. This set of patterns can be analyzed in…

Other Computer Science · Computer Science 2008-02-21 Alexis Ballier , Bruno Durand , Emmanuel Jeandel

We show that the possible Cantor-Bendixson ranks of countable SFTs are exactly the finite ordinals and ordinals of the form $\lambda + 3$, where $\lambda$ is a computable ordinal. This result was claimed by the author in his PhD…

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

We introduce a notion of residual derivative for elements of a preordered set, a construction that generalizes both the Frattini subgroup in algebra and the Cantor-Bendixson derivative in T1 topological spaces. For dual algebraic coframes…

Dynamical Systems · Mathematics 2026-05-15 Silvère Gangloff , Alonso Nuñez

Minimal Cantor systems of finite topological rank (that can be represented by a Bratteli-Vershik diagram with a uniformly bounded number of vertices per level) are known to have dynamical rigidity properties. We establish that such systems,…

Dynamical Systems · Mathematics 2020-03-17 Sebastián Donoso , Fabien Durand , Alejandro Maass , Samuel Petite

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

Logic · Mathematics 2022-07-19 Merlin Carl , Philipp Schlicht , Philip Welch

We study the complexity of automatic structures via well-established concepts from both logic and model theory, including ordinal heights (of well-founded relations), Scott ranks of structures, and Cantor-Bendixson ranks (of trees). We…

Logic · Mathematics 2008-09-22 Bakhadyr Khoussainov , Mia Minnes

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

There are two major ways of constructing 4d $\mathcal{N}=2$ superconformal field theories (SCFTs): the first one is putting a 6d $(2,0)$ theory on a punctured Riemann surface (class-S theory), and the second one is putting type IIB string…

High Energy Physics - Theory · Physics 2023-05-31 Bohan Li , Dan Xie , Wenbin Yan

Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.

Logic in Computer Science · Computer Science 2024-05-24 Ludwig Staiger

An important question in dynamical systems is the classification problem, i.e., the ability to distinguish between two isomorphic systems. In this work, we study the topological factors between a family of multidimensional substitutive…

Dynamical Systems · Mathematics 2025-06-11 Christopher Cabezas , Julien Leroy

In this article, we study countable sofic shifts of Cantor-Bendixson rank at most 2. We prove that their conjugacy problem is complete for GI, the complexity class of graph isomorphism, and that the existence problems of block maps, factor…

Dynamical Systems · Mathematics 2014-08-29 Ville Salo , Ilkka Törmä

R. Pavlov and S. Schmieding provided recently some results about generic $\mathbb{Z}$-shifts, which rely mainly on an original theorem stating that isolated points form a residual set in the space of $\mathbb{Z}$-shifts such that all other…

Dynamical Systems · Mathematics 2025-06-10 Silvère Gangloff , Alonso Núñez

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ä

The definition of subshifts of finite symbolic rank is motivated by the finite rank measure-preserving transformations which have been extensively studied in ergodic theory. In this paper we study subshifts of finite symbolic rank as…

Dynamical Systems · Mathematics 2025-02-12 Su Gao , Ruiwen Li

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ä

We consider the structure of aperiodic points in $\mathbb Z^2$-subshifts, and in particular the positions at which they fail to be periodic. We prove that if a $\mathbb Z^2$-subshift contains points whose smallest period is arbitrarily…

Discrete Mathematics · Computer Science 2018-05-24 Anael Grandjean , Benjamin Hellouin de Menibus , Pascal Vanier
‹ Prev 1 2 3 10 Next ›