Related papers: Shifts on the lamplighter group

Let $A$ be a finite set and $G$ a group. A closed subset $X$ of $A^G$ is called a subshift if the action of $G$ on $A^G$ preserves $X$. If $K$ is a closed subset of $A^G$ such that membership in $K$ is determined by looking at a fixed…

We present a technique to lift some tilings of the discrete hyperbolic plane -- tilings defined by a 1D substitution -- into a zero entropy subshift of finite type (SFT) on non-abelian amenable Baumslag-Solitar groups $BS(1,n)$ for…

We study the periodicity of subshifts of finite type (SFT) on Baumslag-Solitar groups. We show that for residually finite Baumslag-Solitar groups there exist both strongly and weakly-but-not-strongly aperiodic SFTs. In particular, this…

Let $G,H$ be two countable amenable groups. We introduce the notion of group charts, which gives us a tool to embed an arbitrary $H$-subshift into a $G$-subshift. Using an entropy addition formula derived from this formalism we prove that…

We prove that every polycyclic group of nonlinear growth admits a strongly aperiodic SFT and has an undecidable domino problem. This answers a question of [4] and generalizes the result of [2].

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 this work we study the entropies of subsystems of shifts of finite type (SFTs) and sofic shifts on countable amenable groups. We prove that for any countable amenable group $G$, if $X$ is a $G$-SFT with positive topological entropy $h(X)…

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 the inert subgroups of the lamplighter group fall into exactly five commensurability classes. The result is then connected with the theory of totally disconnected locally compact groups and with algebraic entropy.

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…

It is possible to define mixing properties for subshifts according to the intensity which allows to concatenate two rectangular blocks. We study the interplay between this intensity and computational properties. In particular we prove that…

We prove that all invariant random subgroups of the lamplighter group $L$ are co-sofic. It follows that $L$ is permutation stable, providing an example of an infinitely presented such a group. Our proof applies more generally to all…

We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…

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.

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…

Let $G=\left\langle S|R_{A}\right\rangle $ be a semigroup with generating set $ S$ and equivalences $R_{A}$ among $S$ determined by a matrix $A$. This paper investigates the complexity of $G$-shift spaces by yielding the topological…

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…

The set of automorphisms of a one-dimensional \shift $(X, \sigma)$ forms a countable, but often very complicated, group. For zero entropy shifts, it has recently been shown that the automorphism group is more tame. We provide the first…

We introduce a notion of "simulation" for labelled graphs, in which edges of the simulated graph are realized by regular expressions in the simulating graph, and prove that the tiling problem (aka "domino problem") for the simulating graph…

We prove that any finitely generated torsion free solvable subgroup of the group ${\rm IET}$ of all Interval Exchange Transformations is virtually abelian. In contrast, the lamplighter groups $A\wr \mathbb{Z}^k$ embed in ${\rm IET}$ for…