SearcharxivSearch

arXiv · 2501.07438

Bounded cohomology and scl of verbal wreath products

Abstract

We study the bounded cohomology and the stable commutator length of verbal wreath products $\Gamma \wr^{_W}A$, where $A$ has trivial bounded cohomology for a sufficiently large class of coefficients.\\ We prove that the stable commutator length always vanishes, and that the bounded cohomology vanishes in positive degrees for some such verbal wreath products; including the standard restricted wreath products (extending a recent result by Monod for lamplighters groups), as well as verbal wreath products arising from n-solvable, $n$-nilpotent, and $k$-Burnside $(k = 2, 3, 4, 6)$ verbal products.\ As an application, we show that every group of type $F_p$ isometrically embeds into a group of type $F_p$ with vanishing bounded cohomology in positive degrees for a large class of coefficients.

Explore related subjects

Keep this discovery

BibTeXRIS

Elena Bogliolo. 2025-01-13. Bounded cohomology and scl of verbal wreath products. https://doi.org/10.1017/s0305004126102072

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