English
Related papers

Related papers: Decidable problems in substitution shifts

200 papers

Automorphism groups are intrincate conjugacy invariants for subshifts, which can reveal important features of the dynamical structure of a shift action. One important case is the study of automorphism groups when the underlying subshift has…

Dynamical Systems · Mathematics 2019-06-05 Álvaro Bustos

Substitutability, interchangeability and related concepts in Constraint Programming were introduced approximately twenty years ago and have given rise to considerable subsequent research. We survey this work, classify, and relate the…

Artificial Intelligence · Computer Science 2010-10-25 Shant Karakashian , Robert Woodward , Berthe Y. Choueiry , Steven Prestwhich , Eugene C. Freuder

The classical low-dimensional models of thin structures are based on certain a priori assumptions on the three-dimensional deformation and/or stress fields, diverse in nature but all motivated by the smallness of certain dimensions with…

Mathematical Physics · Physics 2013-05-15 Roberto Paroni , Paolo Podio-Guidugli

This paper aims to better understand the link better understand the links between aperiodicity in subshifts and pattern complexity. Our main contribution deals with substitutive subshifts, an equivalent to substitutive tilings in the…

Discrete Mathematics · Computer Science 2021-05-04 Etienne Moutot , Coline Petit-Jean

We initiate the study of correspondences for Smale spaces. Correspondences are shown to provide a notion of a generalized morphism between Smale spaces and are a special case of finite equivalences. Furthermore, for shifts of finite type, a…

Dynamical Systems · Mathematics 2016-09-19 Robin J. Deeley , D. Brady Killough , Michael F. Whittaker

Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to…

Logic in Computer Science · Computer Science 2016-09-15 Carlos Areces , Raul Fervari , Guillaume Hoffmann , Mauricio Martel

Models of a generalized nondeterminism are defined by limitations on nonde- terministic behavior of a computing device. A regular realizability problem is a problem of verifying existence of a special sort word in a regular language. These…

Formal Languages and Automata Theory · Computer Science 2015-03-19 A. Rubtsov , M. Vyalyi

We show that separability and second-countability are first-order properties among topological spaces definable in o-minimal expansions of $(\mathbb{R},<)$. We do so by introducing first-order characterizations -- definable separability and…

Logic · Mathematics 2025-06-16 Pablo Andújar Guerrero

Among (isotopy classes of) automorphisms of handlebodies those called irreducible (or generic) are the most interesting, analogues of pseudo-Anosov automorphisms of surfaces. We consider the problem of isotoping an irreducible automorphism…

Geometric Topology · Mathematics 2009-02-21 Leonardo Navarro Carvalho

A nilspace system is a generalization of a nilsystem, consisting of a compact nilspace X equipped with a group of nilspace translations acting on X. Nilspace systems appear in different guises in several recent works, and this motivates the…

Dynamical Systems · Mathematics 2020-10-07 Pablo Candela , Diego González-Sánchez , Balázs Szegedy

The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…

Logic in Computer Science · Computer Science 2021-02-16 G. Antoniou , D. Billington , G. Governatori , M. J. Maher

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 prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

By using a similar pattern of arguments, we show that in three categories the collection of isomorphisms forms a residual subset of the space of morphisms. We first consider surjective continuous mappings on Cantor spaces. Next, we look at…

Dynamical Systems · Mathematics 2026-03-30 Ethan Akin , Benjamin Weiss

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…

Logic in Computer Science · Computer Science 2023-06-22 Khadijeh Keshvardoost , Bartek Klin , Sławomir Lasota , Joanna Ochremiak , Szymon Toruńczyk

In this paper we study substitutions on $A^\mathbb{Z}$ where $A$ is a finite alphabet. We precisely characterize the minimal components of substitution subshifts, give an optimal bound for their number and describe their dynamics. The…

Dynamical Systems · Mathematics 2026-02-16 Raphaël Henry

Relations between some kinds of formal and standard smoothness, for morphisms of schemes, are clarified in surprisingly simple and direct ways, bypassing much of the customarily employed machinery. Even the deep local-to-global property of…

Algebraic Geometry · Mathematics 2016-11-07 Peter M Johnson

The purpose of this paper is to define some notions of movability for morphisms of inverse systems which extend the movability properties of inverse systems and which are compatible with the equivalence relations which define pro-morphisms…

Algebraic Topology · Mathematics 2016-06-09 P. S. Gevorgyan , I. Pop

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

There are several forms of irreducibility in computing systems, ranging from undecidability to intractability to nonlinearity. This paper is an exploration of the conceptual issues that have arisen in the course of investigating speed-up…

Computational Complexity · Computer Science 2011-06-24 Hector Zenil , Fernando Soler-Toscano , Joost J. Joosten