Related papers: Recognizability for sequences of morphisms
Morphisms, structure preserving maps, are everywhere in Mathematics as useful tools for thinking and problem solving, or as objects to study. Here, we argue that the idea of operations being compatible across two domains goes beyond its…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
Sofic shifts are symbolic dynamical systems defined by the set of bi-infinite sequences on an edge-labeled directed graph, called a presentation. We study the computational complexity of an array of natural decision problems about…
We study the rotational structures of aperiodic tilings in Euclidean space of arbitrary dimension using topological methods. Classical topological approaches to the study of aperiodic patterns have largely concentrated just on translational…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
Parikh-collinear morphisms have the property that all the Parikh vectors of the images of letters are collinear, i.e., the associated adjacency matrix has rank 1. In the conference DLT-WORDS 2023 we showed that fixed points of…
Let A be a finite alphabet and f: A^* --> A^* be a morphism with an iterative fixed point f^\omega(\alpha), where \alpha{} is in A. Consider the subshift (X, T), where X is the shift orbit closure of f^\omega(\alpha) and T: X --> X is the…
A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…
We show that if the complexity difference function p(n+1)-p(n) of a infinite minimal shift is bounded, then the the automorphism group of the one-sided shift is finite, and the automorphism group of the corresponding two-sided shift "modulo…
We show that, for each finite algebra A, either it has symmetric term operations of all arities or else some finite algebra in the variety generated by A has two automorphisms without a common fixed point. We also show this two-automorphism…
Looking at some monoids and (semi)rings (natural numbers, integers and p-adic integers), and more generally, residually finite algebras (in a strong sense), we prove the equivalence of two ways for a function on such an algebra to behave…
We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern…
A marked free monoid morphism is a morphism for which the image of each generator starts with a different letter, and immersions are the analogous maps in free groups. We show that the (simultaneous) PCP is decidable for immersions of free…
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…
The sets of $\cB$-free integers are considered with respect to (reversing) symmetries. It is well known that, for a large class of them, the centraliser of the associated $\cB$-free shift (otherwise known as its automorphism group) is…
In this paper, we deal with reversing and extended symmetries of shifts generated by bijective substitutions. We provide equivalent conditions for a permutation on the alphabet to generate a reversing/extended symmetry, and algorithms how…
We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…
Let $t=t_1t_2\cdots$ be an element of the full shift with shift map $\tau$ on a finite set of characters $\mathcal{A}$ and let $ \Sigma=\text{ closure} \{\tau^i(t):\;i\in\N\cup\{0\}\}$. Let $f_t=f_{t_1,\,\infty}=\cdots\circ f_{t_2}\circ…
We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give…
Tarski gave a general semantics for deductive reasoning: a formula a may be deduced from a set A of formulas iff a holds in all models in which each of the elements of A holds. A more liberal semantics has been considered: a formula a may…