Related papers: A modified proof for Higman's embedding theorem
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…
The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…
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…
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…
In the context of Higman embeddings of recursive groups into finitely presented groups we suggest an algorithm which uses Higman operations to explicitly constructs the specific recursively enumerable sets of integer sequences arising…
Explicit embeddings of the group $\mathbb{Q}$ into a finitely presented group $\mathcal{Q}$ and into a $2$-generator finitely presented group $T_{\mathcal{Q}}$ are suggested. The constructed embeddings reflect questions mentioned by…
For all sufficiently large odd integers $n$, the following version of Higman's embedding theorem is proved in the variety ${\cal B}_n$ of all groups satisfying the identity $x^n=1$. A finitely generated group $G$ from ${\cal B}_n$ has a…
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…
An auxiliary free construction $*_{i=1}^{r}(K_i, L_i, t_i)_M$ based on HNN-extensions and on generalized free product of groups with amalgamated subgroups is suggested, and some of its basic properties are displayed. The proposed…
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…
A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…
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…
We observe that the group of all lifts of elements of Thompson's group $T$ to the real line is finitely presented and contains the additive group $\mathbb{Q}$ of the rational numbers. This gives an explicit realization of the Higman…
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…
In this paper, we prove a series of results on group embeddings in groups with a small number of generators. We show that each finitely generated group $G$ lying in a variety ${\mathcal M}$ can be embedded in a $4$-generated group $H \in…
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 give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…
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 every finite semigroup embeds in a finitely presented congruence-free monoid, and pose some questions around the Boone-Higman Conjecture.
For a countable group G = <A | R> presented by its generators A and defining relations R we discuss a simple method to embed G into such a 2-generator group T that the images of generators from A are explicitly given in T, and the defining…