Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.06224

Hyperbolic groups satisfy the Boone-Higman conjecture

James Belk·Collin Bleak·Francesco Matucci·Matthew C. B. Zaremsky
View original source ↗Read source document ↗Export metadata ↓

Abstract

The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each hyperbolic group embeds in some finitely presented simple group. This shows that the conjecture holds in the "generic" case for finitely presented groups. Our key tool is a new family of groups, which we call "rational similarity groups (RSGs)", that is interesting in its own right. We prove that every hyperbolic group embeds in a full, contracting RSG, and every full, contracting RSG embeds in a finitely presented simple group, thus establishing the result. Another consequence of our work is that all contracting self-similar groups satisfy the Boone-Higman conjecture.

Explore related subjects

math.GRmath.DS

Keep this discovery

BibTeXRIS

James Belk, Collin Bleak, Francesco Matucci, Matthew C. B. Zaremsky. 2023-09-12. Hyperbolic groups satisfy the Boone-Higman conjecture. https://arxiv.org/abs/2309.06224

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↗