Higher rank lamplighter groups are graph automatic
Group Theory
2017-06-09 v1
Abstract
We show that the higher rank lamplighter groups, or Diestel-Leader groups for , are graph automatic. This introduces a new family of graph automatic groups which are not automatic.
Cite
@article{arxiv.1706.02635,
title = {Higher rank lamplighter groups are graph automatic},
author = {Sophie Bérubé and Tara Palnitkar and Jennifer Taback},
journal= {arXiv preprint arXiv:1706.02635},
year = {2017}
}