Higher rank lamplighter groups are graph automatic
classification
🧮 math.GR
keywords
automaticgroupsgraphhigherlamplighterrankdiestel-leaderfamily
read the original abstract
We show that the higher rank lamplighter groups, or Diestel-Leader groups $\Gamma_d(q)$ for $d \geq 3$, are graph automatic. This introduces a new family of graph automatic groups which are not automatic.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.