On isomorphisms to a free group and beyond

DOI10.46298/JGCC.2024.16.1.12282MaRDI QIDQ6601472

Vladimir Shpilrain

Publication date: 10 September 2024

Published in: Journal of Groups, Complexity, Cryptology (Search for Journal in Brave)

zbMATH Keywords

algorithmword problemdecision problemfinitely presented group

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• The isomorphism problem for all hyperbolic groups.
• Limit groups for relatively hyperbolic groups. I: The basic tools.
• Enumerating limit groups.
• Elementary theory of free non-abelian groups.
• The isomorphism problem for finitely generated fully residually free groups.
• Generic properties of Whitehead's algorithm and isomorphism rigidity of random one-relator groups.
• Some general algorithms. II: Nilpotent groups
• Combinatorial group theory.
• The isomorphism problem for hyperbolic groups. I
• The Algorithmic Theory of Finitely Generated Metabelian Groups
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: On isomorphisms to a free group and beyond

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6601472)