Related papers: Progress around the Boone-Higman Conjecture

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

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…

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…

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

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…

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…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

We prove that, for a finitely generated residually finite group, having solvable word problem is not a sufficient condition to be a subgroup of a finitely presented residually finite group. The obstruction is given by a residually finite…

For every finitely generated recursively presented group G we construct a finitely presented group H containing G such that G is (Frattini) embedded into H and the group H has solvable conjugacy problem if and only if G has solvable…

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 show that every countable group H with solvable word problem (=computable group) can be subnormally embedded into a 2-generated group G which also has solvable word problem. Moreover, the membership problem for H < G is also solvable. We…

In 1968, John Thompson proved that a finite group $G$ is solvable if and only if every $2$-generator subgroup of $G$ is solvable. In this paper, we prove that solvability of a finite group $G$ is guaranteed by a seemingly weaker condition:…

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 the existence of finitely presented torsion-free groups with decidable word problem that cannot be embedded in any finitely generated group with decidable conjugacy problem. This answers a well-known question of Collins from the…

We propose an algorithm which for any recursive group $G$, given by its effectively enumerable generators and recursively enumerable relations, outputs an explicit embedding of $G$ into a finitely presented group directly written by its…

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Anisimov and Seifert show that a group has a regular word problem ifand only if it is finite. Muller and Schupp (together with Dunwoody's accessibility result) show that a group has context free word problem if and only if it is virtually…

In 1968, John Thompson proved that a finite group G is solvable if and only if every 2-generator subgroup of G is solvable. In this paper, we prove that solvability of a finite group G is guaranteed by a seemingly weaker condition: G is…

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…

Let w be a group word. It is conjectured that if w has only countably many values in a profinite group G, then the verbal subgroup w(G) is finite. In the present paper we confirm the conjecture in the cases where w is a multilinear…