SearcharxivSearch

arXiv · 1701.02919

Coarse fundamental groups and box spaces

Abstract

We use a coarse version of the fundamental group first introduced by Barcelo, Kramer, Laubenbacher and Weaver to show that box spaces of finitely presented groups detect the normal subgroups used to construct the box space, up to isomorphism. As a consequence we have that two finitely presented groups admit coarsely equivalent box spaces if and only if they are commensurable via normal subgroups. We also provide an example of two filtrations $(N_i)$ and $(M_i)$ of a free group $F$ such that $M_i>N_i$ for all $i$ with $[M_i:N_i]$ uniformly bounded, but with $\Box_{(N_i)}F$ not coarsely equivalent to $\Box_{(M_i)}F$. Finally, we give some applications of the main theorem for rank gradient and the first $\ell^2$ Betti number, and show that the main theorem can be used to construct infinitely many coarse equivalence classes of box spaces with various properties.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Thiebout Delabie, Ana Khukhro. 2017-12-07. Coarse fundamental groups and box spaces. https://doi.org/10.1017/prm.2018.102

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