Higher rank lamplighter groups are graph automatic

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.

About this item

Creator
Sophie Bérubé
Tara Palnitkar
Jennifer Taback
Date
2018-02-15
Bowdoin Department or Program
Mathematics
Subject
(Cayley) graph automatic group
Automatic group
Diestel–Leader group
Higher rank lamplighter group
Access
Open access

Supplemental Files

Current image, full-size
Current image, reduced-size
Other download options:

Collection organization

Level of Description Summary Catalog Record