Higher rank lamplighter groups are graph automatic
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.