10 research outputs found
Tiling Problems on Baumslag-Solitar groups
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.Comment: In Proceedings MCU 2013, arXiv:1309.104
On the domino problem of the Baumslag-Solitar groups
In [1] we construct aperiodic tile sets on the Baumslag-Solitar groups BS(m, n). Aperiodicity plays a central role in the undecidability of the classical domino problem on Z2, and analogously to this we state as a corollary of the main construction that the Domino problem is undecidable on all Baumslag-Solitar groups. In the present work we elaborate on the claim and provide a full proof of this fact. We also provide details of another result reported in [1]: there are tiles that tile the Baumslag-Solitar group BS(m, n)but none of the valid tilings is recursive. The proofs are based on simulating piecewise affine functions by tiles on BS(m, n).</p
Around the Domino Problem – Combinatorial Structures and Algebraic Tools
Given a finite set of square tiles, the domino problem is the question of whether is it possible to tile the plane using these tiles. This problem is known to be undecidable in the planar case, and is strongly linked to the question of the periodicity of the tiling. In this thesis we look at this problem in two different ways: first, we look at the particular case of low complexity tilings and second we generalize it to more general structures than the plane, groups.
A tiling of the plane is said of low complexity if there are at most mn rectangles of size m × n appearing in it. Nivat conjectured in 1997 that any such tiling must be periodic, with the consequence that the domino problem would be decidable for low complexity tilings. Using algebraic tools introduced by Kari and Szabados, we prove a generalized version of Nivat’s conjecture for a particular class of tilings (a subclass of what is called of algebraic subshifts). We also manage to prove that Nivat’s conjecture holds for uniformly recurrent tilings, with the consequence that the domino problem is indeed decidable for low-complexity tilings.
The domino problem can be formulated in the more general context of Cayley graphs of groups. In this thesis, we develop new techniques allowing to relate the Cayley graph of some groups with graphs of substitutions on words. A first technique allows us to show that there exists both strongly periodic and weakly-but-not-strongly aperiodic tilings of the Baumslag-Solitar groups BS(1, n). A second technique is used to show that the domino problem is undecidable for surface groups. Which provides yet another class of groups verifying the conjecture saying that the domino problem of a group is decidable if and only if the group is virtually free
LIPIcs, Volume 244, ESA 2022, Complete Volume
LIPIcs, Volume 244, ESA 2022, Complete Volum