SearcharxivSearch

arXiv · 2206.08775

Dead ends on wreath products and lamplighter groups

Abstract

For any finite group $A$ and any finitely generated group $B$, we prove that the corresponding lamplighter group $A\wr B$ admits a standard generating set with unbounded depth, and that if $B$ is abelian then the above is true for every standard generating set. This generalizes the case where $B=\mathbb{Z}$ together with its cyclic generator due to Cleary and Taback. When $B=H*K$ is the free product of two finite groups $H$ and $K$, we characterize which standard generators of the associated lamplighter group have unbounded depth in terms of a geometrical constant related to the Cayley graphs of $H$ and $K$. In particular, we find differences with the one-dimensional case: the lamplighter group over the free product of two sufficiently large finite cyclic groups has uniformly bounded depth with respect to some standard generating set.

Explore related subjects

Keep this discovery

BibTeXRIS

Eduardo Silva. 2022-06-17. Dead ends on wreath products and lamplighter groups. https://doi.org/10.1142/s0218196723500571

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