Finiteness properties and Higman's rope trick
arXiv:2607.21727
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 . One naturally wonders whether analogous results hold for the higher finiteness properties and (), i.e., whether every finitely generated recursively presented group embeds into a group of type and whether every finitely generated group embeds into a group of type . We prove that a positive answer to the question that moreover preserves recursive presentability would imply a positive answer to the 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 (hence also never nor ). Thus, any approach to the questions of higher finiteness properties must go via a different route than the Higman rope trick.
8 pages