Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0603059

Filling functions

T. R. Riley
View original source ↗Read source document ↗Export metadata ↓

Abstract

Filling functions are asymptotic invariants of finitely presentable groups; the seminal work on the subject is by M.Gromov. They record features of combinatorial homotopy discs (van Kampen diagrams) filling loops in Cayley 2-complexes. Examples are the Dehn (or isoperimetric) function, the filling length function and the intrinsic diameter (or isodiametric) function. We discuss filling functions from geometric, combinatorial and computational points of view, we survey their interrelationships, and we sketch their roles in the studies of nilpotent groups, hyperbolic groups and asymptotic cones. Many open questions are included. This is a set of notes for a workshop on "The Geometry of the Word Problem" at the Centre de Recerca Matematica, Barcelona in July 2005. It will be part of a Birkhauser-Verlag volume in the "Advanced Courses in Mathematics CRM Barcelona" series.

Explore related subjects

math.GR

Keep this discovery

BibTeXRIS

T. R. Riley. 2006-03-02. Filling functions. https://arxiv.org/abs/math/0603059

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗