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.
Let $Gamma_d(q)$ denote the group whose Cayley graph with respect to a particular generating set is the Diestel-Leader graph $DL_d(q)$, as described by Bartholdi, Neuhauser and Woess. We compute both $Aut(Gamma_d(q))$ and $Out(Gamma_d(q))$ for $d geq 2$, and apply our results to count twisted conjugacy classes in these groups when $d geq 3$. Specifically, we show that when $d geq 3$, the groups $Gamma_d(q)$ have property $R_{infty}$, that is, every automorphism has an infinite number of twisted conjugacy classes. In contrast, when $d=2$ the lamplighter groups $Gamma_2(q)=L_q = {mathbb Z}_q wr {mathbb Z}$ have property $R_{infty}$ if and only if $(q,6) eq 1$.
We describe a family of finitely presented groups which are quasi-isometric but not bilipschitz equivalent. The first such examples were described by the first author and are the lamplighter groups $F wr mathbb{Z}$ where $F$ is a finite group; these groups are finitely generated but not finitely presented. The examples presented in this paper are higher rank generalizations of these lamplighter groups and include groups that are of type $F_n$ for any $n$.
We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language class $mathcal C$, we call the resulting groups $mathcal C$-graph automatic. We prove that the class of $mathcal C$-graph automatic groups is closed under change of generating set, direct and free product for certain classes $mathcal C$. We show that for quasi-realtime counter-graph automatic groups where normal forms have length that is linear in the geodesic length, there is an algorithm to compute normal forms (and therefore solve the word problem) in polynomial time. The class of quasi-realtime counter-graph automatic groups includes all Baumslag-Solitar groups, and the free group of countably infinite rank. Context-sensitive-graph automatic groups are shown to be a very large class, which encompasses, for example, groups with unsolvable conjugacy problem, the Grigorchuk group, and Thompsons groups $F,T$ and $V$.
We prove that a group homomorphism $varphicolon Lto G$ from a locally compact Hausdorff group $L$ into a discrete group $G$ either is continuous, or there exists a normal open subgroup $Nsubseteq L$ such that $varphi(N)$ is a torsion group provided that $G$ does not include $mathbb{Q}$ or the $p$-adic integers $mathbb{Z}_p$ or the Prufer $p$-group $mathbb{Z}(p^infty)$ for any prime $p$ as a subgroup, and if the torsion subgroups of $G$ are small in the sense that any torsion subgroup of $G$ is artinian. In particular, if $varphi$ is surjective and $G$ additionaly does not have non-trivial normal torsion subgroups, then $varphi$ is continuous. As an application we obtain results concerning the continuity of group homomorphisms from locally compact Hausdorff groups to many groups from geometric group theory, in particular to automorphism groups of right-angled Artin groups and to Helly groups.
Recent papers of the authors have completely described the hyperbolic actions of several families of classically studied solvable groups. A key tool for these investigations is the machinery of confining subsets of Caprace, Cornulier, Monod, and Tessera, which applies, in particular, to solvable groups with virtually cyclic abelianizations. In this paper, we extend this machinery and give a correspondence between the hyperbolic actions of certain solvable groups with higher rank abelianizations and confining subsets of these more general groups. We then apply this extension to give a complete description of the hyperbolic actions of a family of groups related to Baumslag-Solitar groups.