Polynomially-bounded Dehn functions of groups

From MaRDI portal



Abstract: On the one hand, it is well known that the only subquadratic Dehn function of finitely presented groups is the linear one. On the other hand there is a huge class of Dehn functions d(n) with growth at least n4 (essentially all possible such Dehn functions) constructed in cite{SBR} and based on the time functions of Turing machines and S-machines. The class of Dehn functions nalpha with alphain(2;4) remained more mysterious even though it has attracted quite a bit of attention (see, for example, cite{BB}). We fill the gap obtaining Dehn functions of the form nalpha (and much more) for all real alphage2 computable in reasonable time, for example, alpha=pi or alpha=e, or alpha is any algebraic number. As in cite{SBR}, we use S-machines but new tools and new way of proof are needed for the best possible lower bound d(n)gen2.


Summary: It is well known that every subquadratic Dehn function is linear. A question by Bridson asked to describe the isoperimetric spectrum of groups, that is the set of all numbers \(\alpha\) such that \(n^\alpha\) is equivalent to the Dehn function of a finitely presented group. The goal of this paper is to give a description of the isoperimetric spectrum. Earlier a similar description was given by \textit{M. V. Sapir} et al. [Ann. Math. (2) 156, No. 2, 345--466 (2002; Zbl 1026.20021)] for the intersection of the isoperimetric spectrum with \([4,\infty]\). Lowering the bound from 4 to 2 required significant new ideas and tools.











This page was built for publication: Polynomially-bounded Dehn functions of groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1630588)