Related papers: Boone--Higman Embeddings for Contracting Self-Simi…
We prove that every finitely presented self-similar group embeds in a finitely presented simple group. This establishes that every group embedding in a finitely presented self-similar group satisfies the Boone-Higman conjecture. The simple…
The Boone--Higman conjecture is that every recursively presented group with solvable word problem embeds in a finitely presented simple group. We discuss a brief history of this conjecture and work towards it. Along the way we describe some…
This note serves as a short and reader-friendly introduction to twisted Brin-Thompson groups, which were recently constructed by Belk and the author to provide a family of simple groups with a variety of interesting properties. Most…
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…
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…
We show that the \s{\phi}-labeled Thompson groups and the twisted Brin--Thompson groups are boundedly acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically…
We show that labelled Thompson groups and twisted Brin--Thompson groups are all acyclic. This allows us to prove several new embedding results for groups. First, every group of type $F_n$ embeds quasi-isometrically as a subgroup of an…
We give a direct proof that all Higman-Thompson groups of the form $G_{k,1}$ (for $k \ge 2$) are embedded in one another, which is a recent result of N. Matte Bon. This extends the embeddings given by Higman in 1974.
We prove finiteness properties for groups of homeomorphisms that have finitely many "singular points", and we describe the normal structure of such groups. As an application, we prove that every countable abelian group can be embedded into…
We prove that every countable left-ordered group embeds into a finitely generated left-ordered simple group. Moreover, if the first group has a computable left-order, then the simple group also has a computable left-order. We also obtain a…
We develop a method for proving the Boone--Higman Conjecture for groups acting on locally finite trees. As a consequence, we prove the Boone--Higman Conjecture for all Baumslag--Solitar groups and for all free(finite rank)-by-cyclic groups,…
We construct a family of infinite simple groups that we call \emph{twisted Brin-Thompson groups}, generalizing Brin's higher-dimensional Thompson groups $sV$ ($s\in\mathbb{N}$). We use twisted Brin-Thompson groups to prove a variety of…
Given a group $G$ acting faithfully on a set $S$, one gets a simple group denoted $SV_G$, called a twisted Brin--Thompson group. In this paper we drop the faithfulness assumption, and get an abstract version of a twisted Brin--Thompson…
We prove that every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.
We introduce "braided" versions of self-similar groups and R\"over--Nekrashevych groups, and study their finiteness properties. This generalizes work of Aroca and Cumplido, and the first author and Wu, who considered the case when the…
We prove that every finitely-generated right-angled Artin group can be embedded into some Brin-Thompson group $nV$. It follows that many other groups can be embedded into some $nV$ (e.g., any finite extension of any of Haglund and Wise's…
Nekrashevych associated to each self-similar group action an ample groupoid and a $\mathrm{C}^\ast$-algebra. We perform complete computations of the homology of the groupoid and the K-theory of the $\mathrm{C}^\ast$-algebra for a myriad of…
We prove that all Gromov hyperbolic groups embed into the asynchronous rational group defined by Grigorchuk, Nekrashevych and Sushchanski\u{i}. The proof involves assigning a system of binary addresses to points in the Gromov boundary of…
We suggest a modified and briefer version for the proof of Higman's embedding theorem stating that a finitely generated group can be embedded in a finitely presented group if and only if it is recursively presented. In particular, we…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…