SearcharxivSearch

arXiv · 2405.10234

Boone--Higman Embeddings for Contracting Self-Similar Groups

Abstract

We give a short proof that every contracting self-similar group embeds into a finitely presented simple group. In particular, any contracting self-similar group embeds into the corresponding R\"over--Nekrashevych group, and this in turn embeds into one of the twisted Brin--Thompson groups introduced by the first author and Matthew Zaremsky. The proof here is a simplification of a more general argument given by the authors, Collin Bleak, and Matthew Zaremsky for contracting rational similarity groups.

Explore related subjects

Keep this discovery

BibTeXRIS

James Belk, Francesco Matucci. 2024-05-16. Boone--Higman Embeddings for Contracting Self-Similar Groups. https://arxiv.org/abs/2405.10234

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