SearcharxivSearch

arXiv · 2104.07431

One-ended spanning subforests and treeability of groups

Abstract

We show that several new classes of groups are measure strongly treeable. In particular, finitely generated groups admitting planar Cayley graphs, elementarily free groups, and the group of isometries of the hyperbolic plane and all its closed subgroups. This provides the first examples of one-ended nonamenable groups which are measure strongly treeable. In higher dimensions, we also prove a dichotomy that the fundamental group of a closed aspherical 3-manifold is either amenable or has strong ergodic dimension 2. Our main technical tool is a method for finding measurable treeings of Borel planar graphs by constructing one-ended spanning subforests in their planar dual. Our techniques for constructing one-ended spanning subforests also give a complete classification of the locally finite pmp graphs which admit Borel a.e. one-ended spanning subforests.

Explore related subjects

Keep this discovery

BibTeXRIS

Clinton T. Conley, Damien Gaboriau, Andrew S. Marks, Robin D. Tucker-Drob. 2021-04-15. One-ended spanning subforests and treeability of groups. https://arxiv.org/abs/2104.07431

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