Higher rank lamplighter groups are graph automatic

2017/06/08 by Sophie Bérubé, Bérubé, Sophie, Tara Palnitkar +3
Mathematics · #20F65 #68Q45 #FOS: Mathematics #Group Theory (math.GR) #math.GR #msc:20F65 #msc:68Q45

paper · pdf · doi:10.48550/arxiv.1706.02635

arxiv created 2017/06/08 · arxiv updated 2017/06/09

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.

Related

• Automorphisms of Higher Rank Lamplighter Groups
• From automatic structures to automatic groups
• Metric Properties of Diestel-Leader Groups
• Automaticity for graphs of groups
• Thompson's group F is 1-counter graph automatic