Higher rank lamplighter groups are graph automatic

DOI10.1016/j.jalgebra.2017.09.038zbMath1427.20055arXiv1706.02635OpenAlexW2963134545MaRDI QIDQ1686145

Tara Palnitkar, Jennifer Taback, Sophie Bérubé

Publication date: 21 December 2017

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.02635

zbMATH Keywords

automatic group(Cayley) graph automatic groupDiestel-Leader grouphigher rank lamplighter group

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Geometric group theory (20F65) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Related Items (4)

On the geometry of Cayley automatic groups ⋮ Lamplighter groups and automata ⋮ Cayley polynomial-time computable groups ⋮ BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Thompson's group \(F\) is 1-counter graph automatic.
• Metric properties of Diestel-Leader groups.
• \(\mathcal C\)-graph automatic groups.
• The Dehn function of Baumslag's metabelian group.
• Coarse differentiation of quasi-isometries. I: Spaces not quasi-isometric to Cayley graphs
• Metabelian groups with quadratic Dehn function and Baumslag-Solitar groups.
• Tree-based language complexity of Thompson's group \(F\).
• Horocyclic products of trees
• Automatic groups: A guided tour
• From automatic structures to automatic groups.
• On Automatic Transitive Graphs
• Automorphisms of higher rank lamplighter groups
• A conjecture concerning a limit of non-Cayley graphs

This page was built for publication: Higher rank lamplighter groups are graph automatic