SearcharxivSearch

arXiv · 0911.4234

Quasi-morphisms on Free Groups

Abstract

Let F be the free group over a set of two or more generators. R. Brooks constructed an infinite family of quasi-morphisms on F such that an infinite subfamily gives rise to independent classes in the second bounded cohomology of F, which proves that this space is infinite dimensional. We give a simpler proof of this fact using a different type of quasi-morphisms. After computing the Gromov norm of the corresponding bounded classes, we generalize our example to obtain quasi-morphisms on free products, as well as quasi-morphisms into groups without small subgroups, also known as epsilon-representations.

Explore related subjects

Keep this discovery

BibTeXRIS

Pascal Rolli. 2009-11-24. Quasi-morphisms on Free Groups. https://arxiv.org/abs/0911.4234

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