The Higman operations and embeddings of recursive groups

2020/02/22 by Vahagn H. Mikaelian, Mikaelian, V. H. · 1 citation
Computer Science · Mathematics · #20D15 #20E10 #20E22 #20K01 #20K25 #Advanced Topology and Set Theory #FOS: Mathematics #Geometric and Algebraic Topology #Group Theory (math.GR) #semigroups and automata theory

paper · pdf · doi:10.48550/arxiv.2002.09728

openalex publication_date 2020/02/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

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 during the embeddings. This makes the constructive Higman embedding a doable task for certain wide classes of groups. Specific auxiliary operations are introduced to make the work with Higman operations a simpler and more intuitive procedure. Also, an automated mechanism of constructive embeddings of countable groups into 2-generator groups is mentioned.

Cited by

• Explicit construction of benign subgroup for Higman's reversing operation

Related

• Higman operations on integer sequences, and embeddings of recursive groups
• An explicit algorithm for the Higman Embedding Theorem
• A modified proof for Higman's embedding theorem
• The Conjugacy Problem and Higman Embeddings
• On explicit embeddings of ℚ into finitely presented groups