The conjugacy problem and Higman embeddings

DOI10.1090/memo/0804zbMath1055.20023OpenAlexW2155749794MaRDI QIDQ4809799

Mark V. Sapir, Alexander Yu. Ol'shanskii

Publication date: 31 August 2004

Published in: Memoirs of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.237.9564

zbMATH Keywords

finitely generated groupsword problemfinitely presented groupsconjugacy problemrecursively presented groupsTuring degreesHigman embeddings

Mathematics Subject Classification ID

Subgroup theorems; subgroup growth (20E07) Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Cancellation theory of groups; application of van Kampen diagrams (20F06)

Related Items (11)

Negative immersions for one-relator groups ⋮ Decidability problem for exponential equations in finitely presented groups ⋮ Embeddings into left‐orderable simple groups ⋮ Algorithmic problems in groups with quadratic Dehn function ⋮ The conjugacy problem for groups, and Higman embeddings ⋮ Detecting conjugacy stability of subgroups in certain classes of groups ⋮ Space functions of groups ⋮ Conjugacy problem in groups with quadratic Dehn function ⋮ On decidability of amenability in computable groups ⋮ A Higman embedding preserving asphericity ⋮ Asymptotic invariants, complexity of groups and related problems

This page was built for publication: The conjugacy problem and Higman embeddings