SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM

DOI10.1142/S0218196705002670zbMATH Open1100.20029arXivmath/0405337OpenAlexW2134228923MaRDI QIDQ3379485FDOQ3379485

Authors: Alexander Y. Olshanskii, Mark Sapir 

Publication date: 6 April 2006

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

Abstract: We prove that every countable group with solvable power problem embeds into a finitely presented 2-generated group with solvable power and conjugacy problems.

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

Recommendations

• On Embedding Groups and the Conjugacy Problem
• The conjugacy problem for groups, and Higman embeddings
• Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
• Finitely generated lattice-ordered groups with soluble word problem
• scientific article; zbMATH DE number 3875526
• A finitely presented group with almost solvable conjugacy problem.
• A finitely presented orderable group with insoluble word problem
• A Note on Recursively Presented and Co-Recursively Presented Groups
• Embeddings into left‐orderable simple groups
• scientific article; zbMATH DE number 3929284

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (19)

• Title not available (Why is that?)
• On finite solvable groups whose cyclic \(p\)-subgroups of equal order are conjugate.
• Obstruction to a Higman embedding theorem for residually finite groups with solvable word problem
• Two problems for solvable and nilpotent groups
• On decidability of amenability in computable groups
• On Embedding Groups and the Conjugacy Problem
• The subgroup identification problem for finitely presented groups.
• Subgroup conjugacy problem for Garside subgroups of Garside groups
• Embedding construction based on amalgamations of group relators
• Asymptotic invariants, complexity of groups and related problems.
• A finitely presented simple group with unsolvable conjugacy problem
• Decidability problem for exponential equations in finitely presented groups
• Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
• Algorithmic problems in groups with quadratic Dehn function
• Embeddings in finitely presented groups which preserve the center.
• On torsion in finitely presented groups.
• The conjugacy problem for groups, and Higman embeddings
• The conjugacy problem and Higman embeddings
• Title not available (Why is that?)

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

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