Vladimir Shpilrain - On isomorphisms to a free group and beyond

gcc:12282 - journal of Groups, complexity, cryptology, May 20, 2024, Volume 16, Issue 1 - https://doi.org/10.46298/jgcc.2024.16.1.12282
On isomorphisms to a free group and beyondArticle

Authors: Vladimir Shpilrain

    The isomorphism problem for infinite finitely presented groups is probably the hardest among standard algorithmic problems in group theory. Classes of groups where it has been completely solved are nilpotent groups, hyperbolic groups, and limit groups. In this short paper, we address the problem of isomorphism to particular groups, including free groups. We also address the algorithmic problem of embedding a finitely presented group in a given limit group.

    Volume: Volume 16, Issue 1
    Published on: May 20, 2024
    Accepted on: May 20, 2024
    Submitted on: September 16, 2023
    Keywords: Mathematics - Group Theory,20F10

    Consultation statistics

    This page has been seen 253 times.
    This article's PDF has been downloaded 103 times.