The conjugacy problem for groups, and Higman embeddings

DOI10.1090/S1079-6762-03-00110-0zbMath1069.20023arXivmath/0212227MaRDI QIDQ4680990

Mark V. Sapir, Alexander Yu. Ol'shanskii

Publication date: 14 June 2005

Published in: Electronic Research Announcements of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0212227

zbMATH Keywords

Turing degrees; solvable conjugacy problem; finitely generated recursively presented groups; Frattini embeddings

Mathematics Subject Classification ID

20E07: Subgroup theorems; subgroup growth

20F05: Generators, relations, and presentations of groups

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

03D40: Word problems, etc. in computability and recursion theory

Related Items

Fractional isoperimetric inequalities and subgroup distortion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isoperimetric and isodiametric functions of groups
• Isoperimetric functions of groups and computational complexity of the word problem
• Subgroups of finitely presented groups
• The Conjugacy Problem and Subgroups of Finite Index
• On subgroup distortion in finitely presented groups
• On Group-Theoretic Decision Problems and Their Classification. (AM-68)
• LENGTH AND AREA FUNCTIONS ON GROUPS AND QUASI-ISOMETRIC HIGMAN EMBEDDINGS
• The conjugacy problem and Higman embeddings
• An Embedding Theorem for Finitely Generated Groups