Related papers: Aperiodic Subshifts on Polycyclic Groups

It is well known that if $G$ admits a f.g. subgroup $H$ with a weaklyaperiodic SFT (resp. an undecidable domino problem), then $G$itself has a weakly aperiodic SFT (resp. an undecidable domino problem).We prove that we can replace the…

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…

In this note we prove the following results: $\bullet$ If a finitely presented group $G$ admits a strongly aperiodic SFT, then $G$ has decidable word problem. More generally, for f.g. groups that are not recursively presented, there exists…

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…

In our article in MCU'2013 we state the the Domino problem is undecidable for all Baumslag-Solitar groups $BS(m,n)$, and claim that the proof is a direct adaptation of the construction of a weakly aperiodic subshift of finite type for…

We show that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property. As an application, we prove that the domino problem is undecidable for the fundamental group of any closed…

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…

Let $G$ be a group with undecidable domino problem, such as $\mathbb{Z}^2$. We prove that all nontrivial dynamical properties for sofic $G$-subshifts are undecidable, that this is not true for $G$-SFTs, and an undecidability result for…

We exhibit a weakly aperiodic tile set for Baumslag-Solitar groups, and prove that the domino problem is undecidable on these groups. A consequence of our construction is the existence of an arecursive tile set on Baumslag-Solitar groups.

We show that, for every finitely generated group with decidable word problem and undecidable domino problem, there exists a sequence of effective subshifts whose inverse limit is not the topological factor of any effective dynamical system.…

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…

It is known that a group shift on a polycyclic group is necessarily of finite type. We show that, for trivial reasons, if a group does not satisfy the maximal condition on subgroups, then it admits non-SFT abelian group shifts. In…

We study the seeded domino problem, the recurring domino problem and the $k$-SAT problem on finitely generated groups. These problems are generalization of their original versions on $\mathbb{Z}^2$ that were shown to be undecidable using…

The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…

We prove that the lamplighter group admits strongly aperiodic SFTs, has undecidable tiling problem, and the entropies of its SFTs are exactly the upper semicomputable nonnegative real numbers, and some other results. These results follow…

We look at constructions of aperiodic SFTs on fundamental groups of graph of groups. In particular we prove that all generalized Baumslag-Solitar groups (GBS) admit a strongly aperiodic SFT. Our proof is based on a structural theorem by…

We show that it is undecidable whether a system of linear equations over the Laurent polynomial ring $\mathbb{Z}[X^{\pm}]$ admit solutions where a specified subset of variables take value in the set of monomials $\{X^z \mid z \in…

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…

We consider a group-theoretic analogue of the classic subset sum problem. It is known that every virtually nilpotent group has polynomial time decidable subset sum problem. In this paper we use subgroup distortion to show that every…

We prove that polycyclic groups are of polynomial growth or of uniform exponential growth.