Related papers: The Higman operations and embeddings of recursive …

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…

This is an extended version of summary of the talk at the International Conference on Group Theory in honor of Victor Mazurov on the occasion of his 80th birthday. The concise version of this report can be found in the talks and…

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…

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…

For an arbitrary countable group G = <A|R> given by its generators A and defining relations R we discuss a specific method for embedding of G into a certain 2-generator group T. Our embedding explicitly lists the images of generators from A…

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…

For the Higman reversing operation $\rho$ and for a set of integer-valued functions $\mathcal X$ the following has been proved. Let the subgroup $A_{\mathcal X}$ be benign in the free group $F$, let the respective finitely presented…

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…

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…

This is a survey of the recent work in algorithmic and asymptotic properties of groups. I discuss Dehn functions of groups, complexity of the word problem, Higman embeddings, and constructions of finitely presented groups with extreme…

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…

We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even…

An embedding construction $G\hookrightarrow H$ for groups $G$ with a length function was introduced by the author earlier. Here we obtain new properties of this embedding, answering some questions raised by M.V. Sapir. In particular, an…

Recursive coalgebras provide an elegant categorical tool for modelling recursive algorithms and analysing their termination and correctness. By considering coalgebras over categories of suitably indexed families, the correctness of the…

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…

We present here new mechanisms for hashing data via binary embeddings. Contrary to most of the techniques presented before, the embedding matrix of our mechanism is highly structured. That enables us to perform hashing more efficiently and…

We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…

We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…

For any torsion-free hyperbolic group $\Gamma$ and any group $G$ that is fully residually $\Gamma$, we construct algorithmically a finite collection of homomorphisms from $G$ to groups obtained from $\Gamma$ by extensions of centralizers,…

This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.