Higher rank lamplighter groups are graph automatic

Abstract

We show that the higher rank lamplighter groups, or Diestel-Leader groups ${\Gamma }_d(q)$ for $d\ge 3$, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.