Tilings and Submonoids of Metabelian Groups
Group Theory
2009-03-05 v1
Abstract
In this paper we show that membership in finitely generated submonoids is undecidable for the free metabelian group of rank 2 and for the wreath product . We also show that subsemimodule membership is undecidable for finite rank free -modules. The proof involves an encoding of Turing machines via tilings. We also show that rational subset membership is undecidable for two-dimensional lamplighter groups.
Keywords
Cite
@article{arxiv.0903.0648,
title = {Tilings and Submonoids of Metabelian Groups},
author = {Markus Lohrey and Benjamin Steinberg},
journal= {arXiv preprint arXiv:0903.0648},
year = {2009}
}