SearcharxivSearch

arXiv · 2607.21727

Finiteness properties and Higman's rope trick

Abstract

In 1961 Higman proved that every finitely generated recursively presented group embeds into a finitely presented group. In 2018 Leary proved that every finitely generated group embeds into a group of type $FP_2$. One naturally wonders whether analogous results hold for the higher finiteness properties $F_n$ and $FP_n$ ($3 \leq n \leq \infty$), i.e., whether every finitely generated recursively presented group embeds into a group of type $F_n$ and whether every finitely generated group embeds into a group of type $FP_n$. We prove that a positive answer to the $FP_n$ question that moreover preserves recursive presentability would imply a positive answer to the $F_n$ question. We also investigate the output groups from Higman's and Leary's proofs, which in both cases arise from the so-called ``Higman rope trick'', and find that they are never of type $FP_3(\mathbb{Q})$ (hence also never $FP_3$ nor $F_3$). Thus, any approach to the questions of higher finiteness properties must go via a different route than the Higman rope trick.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Francesco Fournier-Facio, Matthew C. B. Zaremsky. 2026-07-23. Finiteness properties and Higman's rope trick. https://arxiv.org/abs/2607.21727

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