SearcharxivSearch

arXiv · math/0606273

The mean Dehn function of abelian groups

Abstract

While Dehn functions, D(n), of finitely presented groups are very well studied in the literature, mean Dehn functions are much less considered. M. Gromov introduced the notion of mean Dehn function of a group, $D_{mean}(n)$, suggesting that in many cases it should grow much more slowly than the Dehn function itself. Using only elementary counting methods, this paper presents some computations pointing into this direction. Particularizing them to the case of any finite presentation of a finitely generated abelian group (for which it is well known that $D(n)\sim n^2$ except in the 1-dimensional case), we show that the three variations $D_{osmean}(n)$, $D_{smean}(n)$ and $D_{mean}(n)$ all are bounded above by $Kn(\ln n)^2$, where the constant $K$ depends only on the presentation (and the geodesic combing) chosen. This improves an earlier bound given by Kukina and Roman'kov.

Explore related subjects

Keep this discovery

BibTeXRIS

O. Bogopolski, E. Ventura. 2006-06-12. The mean Dehn function of abelian groups. https://arxiv.org/abs/math/0606273

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