SearcharxivSearch

arXiv · 0805.1755

Combable functions, quasimorphisms, and the central limit theorem

Abstract

A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include (i) homomorphisms to Z (ii) word length with respect to a finite generating set (iii) most known explicit constructions of quasimorphisms (e.g. the Epstein-Fujiwara counting quasimorphisms) We show that bicombable functions on word-hyperbolic groups satisfy a central limit theorem: if \barϕ_n is the value of ϕon a random element of word length n (in a certain sense), there are E and σfor which there is convergence in the sense of distribution n^{-1/2}(\barϕ_n - nE) \to N(0,σ), where N(0,σ) denotes the normal distribution with standard deviation σ. As a corollary, we show that if S_1 and S_2 are any two finite generating sets for G, there is an algebraic number lambda_{1,2} depending on S_1 and S_2 such that almost every word of length n in the S_1 metric has word length nλ_{1,2} in the S_2 metric, with error of size O(\sqrt{n}).

Explore related subjects

Keep this discovery

BibTeXRIS

Danny Calegari, Koji Fujiwara. 2009-06-17. Combable functions, quasimorphisms, and the central limit theorem. https://arxiv.org/abs/0805.1755

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