SearcharxivSearch

arXiv · 1307.3122

Embeddability of generalized wreath products and box spaces

Abstract

Given two finitely generated groups that coarsely embed into a Hilbert space, it is known that their wreath product also embeds coarsely into a Hilbert space. We introduce a wreath product construction for general metric spaces X,Y,Z and derive a condition, called the (delta-polynomial) path lifting property, such that coarse embeddability of X,Y and Z implies coarse embeddability of X\wr_Z Y. We also give bounds on the compression of X\wr_Z Y in terms of delta and the compressions of X,Y and Z. Next, we investigate the stability of the property of admitting a box space which coarsely embeds into a Hilbert space under the taking of wreath products. We show that if an infinite finitely generated residually finite group H has a coarsely embeddable box space, then G\wr H has a coarsely embeddable box space if G is finitely generated abelian. This leads, in particular, to new examples of bounded geometry coarsely embeddable metric spaces without property A.

Explore related subjects

Keep this discovery

BibTeXRIS

Chris Cave, Dennis Dreesen, Ana Khukhro. 2013-07-11. Embeddability of generalized wreath products and box spaces. https://arxiv.org/abs/1307.3122

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