Tiling Problems on Baumslag-Solitar groups

  title={Tiling Problems on Baumslag-Solitar groups},
  author={Nathalie Aubrun and Jarkko Kari},
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. 

Figures from this paper

Addendum to "Tilings problems on Baumslag-Solitar groups"
This addendum clarified the point that the proof is a direct adaptation of the construction of a weakly aperiodic subshift of finite type for BS(m,n) given in the paper, and gave a detailed proof of the undecidability result.
Aperiodic Subshifts on Polycyclic Groups
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].
The domino problem is undecidable on surface groups
It is shown that the domino problem is undecidable on orbit graphs of non-deterministic substitutions which satisfy a technical property and applied to the fundamental group of any closed orientable surface of genus at least 2.
Strongly aperiodic subshifts on surface groups
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
The Domino Problem for Self-similar Structures
The domino problem for tilings over self-similar structures of \(\mathbb {Z}^d\) given by forbidden patterns is defined and non-trivial families of subsets with decidable and undecidable Domino problem are exhibited.
Aperiodic subshifts of finite type on groups which are not finitely generated
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
The domino problem on groups of polynomial growth
We characterize the virtually nilpotent finitely generated groups (or, equivalently by Gromov's theorem, groups of polynomial growth) for which the Domino Problem is decidable: These are the
A strongly aperiodic shift of finite type on the discrete Heisenberg group using Robinson tilings
We explicitly construct a strongly aperiodic subshift of finite type for the discrete Heisenberg group. Our example builds on the classical aperiodic tilings of the plane due to Raphael Robinson.
Some Notes about Subshifts on Groups
If a finitely presented group G admits a strongly aperiodic SFT, then G has decidable word problem, and this is true for the free group with 2 generators, Thompson's groups T and V, PSL2(Z) and any f.g. group of rational matrices which is bounded.
Weakly and Strongly Aperiodic Subshifts of Finite Type on Baumslag-Solitar Groups
It is shown that for residually finite Baumslag-Solitar groups there exist both strongly and weakly-but-not-strongly aperiodic SFTs, and that there exists a strongly a periodicity SFT on BS(n,n), which is similar to that presented by Aubrun and Kari.


A hierarchical strongly aperiodic set of tiles in the hyperbolic plane
A small aperiodic set of Wang tiles
Nonresidually finite one-relator groups
The study of one-relator groups includes the connections between group properties and the form of the relator. In this paper we discuss conditions on the form uiv uvm which force the corresponding
The tiling problem revisited
We give a new proof for the undecidability of the tiling problem. Then we show how the proof can be modified to demonstrate the undecidability of the tiling problem on the hyperbolic plane, thus
The Tiling Problem Revisited (Extended Abstract)
It is shown how the proof can be modified to demonstrate the undecidability of the tiling problem on the hyperbolic plane, thus answering an open problem posed by R.M.Robinson 1971.
The Domino Problem of the Hyperbolic Plane is Undecidable
Logical aspects of Cayley-graphs: the group case
Combinatorial Group Theory
These notes were prepared for use by the participants in the Workshop on Algebra, Geometry and Topology held at the Australian National University, 22 January to 9 February, 1996. They have
On Immortal Configurations in Turing Machines
It is proved that there exists a Turing Machine that is immortal but halts on every recursive configuration, by combining a new proof of Hooper's theorem with recent results on effective symbolic dynamics.
The Theory of Ends, Pushdown Automata, and Second-Order Logic