SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM

DOI10.1142/S0218196705002670zbMath1100.20029arXivmath/0405337OpenAlexW2134228923MaRDI QIDQ3379485

Mark V. Sapir, Alexander Yu. Ol'shanskii

Publication date: 6 April 2006

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

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

zbMATH Keywords

finitely generated groupsword problemfinitely presented groupsconjugacy problemrecursively presented groupsvan Kampen diagramspower problemorder problem

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

Decidability problem for exponential equations in finitely presented groups ⋮ Algorithmic problems in groups with quadratic Dehn function ⋮ Groups with decidable word problem that do not embed in groups with decidable conjugacy problem ⋮ Embedding construction based on amalgamations of group relators ⋮ On decidability of amenability in computable groups ⋮ Asymptotic invariants, complexity of groups and related problems

Cites Work

• Embedding Theorems for Countable Groups
• Unsolvable Problems in Groups With Solvable Word Problem

This page was built for publication: SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM