Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1401.1976

What is a horocyclic product, and how is it related to lamplighters?

Wolfgang Woess
View original source ↗Read source document ↗Export metadata ↓

Abstract

This is a rather personal introductory outline of an interesting class of geometric, resp. graph- and group-theoretical structures. After an introductive section about their genesis, the general construction of horocyclic products is presented. Three closely related basic structures of this type are explained in more detail: Diestel-Leader graphs, treebolic spaces, and Sol-groups, resp. -manifolds. Emphasis is on their geometry, isometry groups, quasi-isometry classification and boundary at infinity. Subsequently, it is clarified under which parametrisation they admit discrete groups of isometries acting with compact quotient. Finally, further develpoments are reviewed briefly. Remark: the posted version contains a correction of a misprint that appeared on the bottom of page 22 in the version which appeared in IMN.

Explore related subjects

math.GRmath.COmath.MG

Keep this discovery

BibTeXRIS

Wolfgang Woess. 2014-01-09. What is a horocyclic product, and how is it related to lamplighters?. https://arxiv.org/abs/1401.1976

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↗