SearcharxivSearch

arXiv · 2503.21882

Boone-Higman embeddings of $\mathrm{Aut}(F_n)$ and mapping class groups of punctured surfaces

Abstract

We prove that the groups $\mathrm{Aut}(F_n)$ satisfy the Boone-Higman conjecture for all $n$, meaning each $\mathrm{Aut}(F_n)$ embeds in a finitely presented simple group. In fact, we prove that each $\mathrm{Aut}(F_n)$ satisfies the "permutational" Boone-Higman conjecture, which means the simple group in question can be taken to be a twisted Brin-Thompson group. A far-reaching consequence of our approach is that finitely presented twisted Brin-Thompson groups are universal among finitely presented simple groups that are highly transitive. This is evidence toward the Boone-Higman conjecture being equivalent to its permutational version. Proving the conjecture for $\mathrm{Aut}(F_n)$ also confirms the conjecture for all groups (virtually) embedding into some $\mathrm{Aut}(F_n)$, such as mapping class groups of non-closed surfaces, braid groups, loop braid groups, ribbon braid groups and certain Artin groups. This answers several questions of the first and fourth authors with Bleak and Matucci. Yet another consequence of our approach is that satisfying the permutational Boone-Higman conjecture is closed under free products.

Explore related subjects

Keep this discovery

BibTeXRIS

James Belk, Francesco Fournier-Facio, James Hyde, Matthew C. B. Zaremsky. 2025-03-27. Boone-Higman embeddings of $\mathrm{Aut}(F_n)$ and mapping class groups of punctured surfaces. https://arxiv.org/abs/2503.21882

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