SearcharxivSearch

arXiv · 1202.4199

Metric Properties of Diestel-Leader Groups

Abstract

In this paper we investigate metric properties of the groups $\Gamma_d(q)$ whose Cayley graphs are the Diestel-Leader graphs $DL_d(q)$ with respect to a given generating set $S_{d,q}$. These groups provide a geometric generalization of the family of lamplighter groups, whose Cayley graphs with respect to a certain generating set are the Diestel-Leader graphs $DL_2(q)$. Bartholdi, Neuhauser and Woess in \cite{BNW} show that for $d \geq 3$, $\Gamma_d(q)$ is of type $F_{d-1}$ but not $F_d$. We show below that these groups have dead end elements of arbitrary depth with respect to the generating set $S_{d,q}$, as well as infinitely many cone types and hence no regular language of geodesics. These results are proven using a combinatorial formula to compute the word length of group elements with respect to $S_{d,q}$ which is also proven in the paper and relies on the geometry of the Diestel-Leader graphs.

Explore related subjects

Keep this discovery

BibTeXRIS

Melanie Stein, Jennifer Taback. 2012-02-20. Metric Properties of Diestel-Leader Groups. https://arxiv.org/abs/1202.4199

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR