Higher rank lamplighter groups are graph automatic
Authors:
- 1 February 2018
- journal article
- research article
- Published by Elsevier in Journal of Algebra
- Vol. 496, 315-343
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation (DMS-1105407)
- Simons Foundation (31736)
This publication has 11 references indexed in Scilit:
- Thompson's group F is 1-counter graph automaticGroups - Complexity - Cryptology, 2016
- Automorphisms of higher rank lamplighter groupsInternational Journal of Algebra and Computation, 2015
- -graph automatic groupsJournal of Algebra, 2014
- From automatic structures to automatic groupsGroups, Geometry, and Dynamics, 2014
- Metric properties of Diestel-Leader groupsThe Michigan Mathematical Journal, 2013
- Coarse differentiation of quasi-isometries I: Spaces not quasi-isometric to Cayley graphsAnnals of Mathematics, 2012
- The Dehn function of Baumslag’s metabelian groupGeometriae Dedicata, 2011
- Metabelian groups with quadratic Dehn function and Baumslag–Solitar groupsConfluentes Mathematici, 2010
- Horocyclic products of treesJournal of the European Mathematical Society, 2008
- A Conjecture Concerning a Limit of Non-Cayley GraphsJournal of Algebraic Combinatorics, 2001