Decidability problem for exponential equations in finitely presented groups
From MaRDI portal
Recommendations
- Groups with decidable word problem that do not embed in groups with decidable conjugacy problem
- On Embedding Groups and the Conjugacy Problem
- A finitely presented group with almost solvable conjugacy problem.
- The power word problem
- scientific article; zbMATH DE number 1361364
- scientific article; zbMATH DE number 5560346
- The isomorphism problem for residually torsion-free nilpotent groups.
- Recursive functions in group theory
- scientific article; zbMATH DE number 4014693
- The conjugacy problem for groups, and Higman embeddings
Cites work
- Detecting properties from descriptions of groups
- Groups with small Dehn functions and bipartite chord diagrams.
- scientific article; zbMATH DE number 3574107 (Why is no real title available?)
- scientific article; zbMATH DE number 7139161 (Why is no real title available?)
- scientific article; zbMATH DE number 7559438 (Why is no real title available?)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- Knapsack in graph groups
- Knapsack in hyperbolic groups
- Knapsack problem for nilpotent groups
- Knapsack problems for wreath products
- Knapsack problems in groups
- Knapsack problems in products of groups
- On Embedding Groups and the Conjugacy Problem
- Rational subsets of unitriangular groups.
- SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
- The conjugacy problem and Higman embeddings
- The SQ-universality of hyperbolic groups
- The word problem for the Burnside varieties
- Turing computability. Theory and applications
- Unsolvable Problems in Groups With Solvable Word Problem
Cited in
(2)
This page was built for publication: Decidability problem for exponential equations in finitely presented groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6052785)