Related papers: Graph subshifts

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…

We give strongly aperiodic subshifts of finite type on every hyperbolic surface group; more generally, for each pair of expansive primitive symbolic substitution systems with incommensurate growth rates, we construct strongly aperiodic…

We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…

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…

A subshift on a group G is a closed, G-invariant subset of A^G, for some finite set A. It is said to be a subshift of finite type (SFT) if it is defined by a finite collection of 'forbidden patterns', to be strongly aperiodic if all point…

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

We introduce subshifts of quasi-finite type as a generalization of the well-known subshifts of finite type. This generalization is much less rigid and therefore contains the symbolic dynamics of many non-uniform systems, e.g., piecewise…

We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…

We characterize which groups splitting as finite graphs of free groups with cyclic edge groups are residually finite. Such a group $G$ is residually finite if and only if all its Baumslag-Solitar subgroups are residually finite. From a…

Graph polynomials are graph parameters invariant under graph isomorphisms which take values in a polynomial ring with a fixed finite number of indeterminates. We study graph polynomials from a model theoretic point of view. In this paper we…

$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields.

A well-established research line in structural and algorithmic graph theory is characterizing graph classes by listing their minimal obstructions. When this list is finite for some class $\mathcal C$ we obtain a polynomial-time algorithm…

A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\R^d$ which contains a translation lattice $\Z^r$ of rank $r < d$ as a subgroup of finite index. A classification into abstract group isomorphism classes is…

We establish conditions under which the fundamental group of a graph of finite $p$-groups is necessarily residually $p$-finite. The technique of proof is independent of previously established results of this type, and the result is also…

In this paper we further develop the theory of one sided shift spaces over infinite alphabets, characterizing one-step shifts as edge shifts of ultragraphs and partially answering a conjecture regarding shifts of finite type (we show that…

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…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

We study non-terminating graph rewriting models, whose local rules are applied non-deterministically -- and yet enjoy a strong form of determinism, namely space-time determinism. Of course in the case of terminating computation it is…

Let $G$ be a group and let $V$ be an algebraic group over an algebraically closed field. We introduce algebraic group subshifts $\Sigma \subset V^G$ which generalize both the class of algebraic sofic subshifts of $V^G$ and the class of…