Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0309344

Dead end words in lamplighter groups and other wreath products

Sean Cleary·Jennifer Taback
View original source ↗Read source document ↗Export metadata ↓

Abstract

We explore the geometry of the Cayley graphs of the lamplighter groups and a wide range of wreath products. We show that these groups have dead end elements of arbitrary depth with respect to their natural generating sets. An element $w$ in a group $G$ with finite generating set $X$ is a dead end element if no geodesic ray from the identity to $w$ in the Cayley graph $Γ(G,X)$ can be extended past $w$. Additionally, we describe some nonconvex behavior of paths between elements in these Cayley graphs and seesaw words, which are potential obstructions to these graphs satisfying the $k$-fellow traveller property.

Explore related subjects

math.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sean Cleary, Jennifer Taback. 2003-09-20. Dead end words in lamplighter groups and other wreath products. https://arxiv.org/abs/math/0309344

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗