Title

Higher rank lamplighter groups are graph automatic

Authors

Sophie Bérubé, Johns Hopkins Bloomberg School of Public Health
Tara Palnitkar, University of Minnesota Twin Cities
Jennifer Taback, Bowdoin College

Document Type

Article

Publication Date

2-15-2018

Abstract

We show that the higher rank lamplighter groups, or Diestel–Leader groups Γd(q) for d≥3, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.

Recommended Citation

Bérubé, Sophie; Palnitkar, Tara; and Taback, Jennifer, "Higher rank lamplighter groups are graph automatic" (2018). Mathematics Faculty Publications. 45.
https://digitalcommons.bowdoin.edu/mathematics-faculty-publications/45