SearcharxivSearch

arXiv · 2502.01849

Quasi-isometric rigidity for lamplighters with lamps of polynomial growth

Abstract

A quasi-isometry between two connected graphs is measure-scaling if one can control precisely the sizes of pre-images of finite subsets. Such a notion is motivated by the work of Eskin-Fisher-Whyte on lamplighters over $\mathbb{Z}$ and the work of Dymarz on biLipschitz equivalences of amenable groups, and led Genevois and Tessera to introduce the scaling group $\text{Sc}(X)$ of an amenable bounded degree graph $X$. The main result of our article is a rigidity property for quasi-isometries between lamplighters with lamps of polynomial growth. Under assumptions on $G$ and $H$, any such quasi-isometry $N\wr G\longrightarrow M\wr H$ must be measure-scaling for some scaling factor depending on the growth degrees of $N$ and $M$. In particular, the scaling group of such wreath products is reduced to $\lbrace 1\rbrace$. As applications, we obtain additional examples of pairs of quasi-isometric groups that are not biLipschitz equivalent. We also give applications to the quasi-isometric classification of some iterated wreath products, and we exhibit the first example of an amenable finitely generated group $H$ which is lamplighter-rigid, in the sense that $\mathbb{Z}/n\mathbb{Z}\wr H$ and $\mathbb{Z}/m\mathbb{Z}\wr H$ are quasi-isometric if and only if $n=m$.

Explore related subjects

Keep this discovery

BibTeXRIS

Vincent Dumoncel. 2025-02-03. Quasi-isometric rigidity for lamplighters with lamps of polynomial growth. https://arxiv.org/abs/2502.01849

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