Decidability problem for exponential equations in finitely presented groups
From MaRDI portal
Publication:6052785
DOI10.4153/s0008439522000698zbMath1522.20126WikidataQ115481664 ScholiaQ115481664MaRDI QIDQ6052785
No author found.
Publication date: 25 September 2023
Published in: Canadian Mathematical Bulletin (Search for Journal in Brave)
Generators, relations, and presentations of groups (20F05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Algebraic geometry over groups; equations over groups (20F70)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Knapsack problem for nilpotent groups
- Groups with small Dehn functions and bipartite chord diagrams.
- Knapsack problems in products of groups
- Knapsack in graph groups
- The word problem for the Burnside varieties
- Detecting properties from descriptions of groups
- Turing Computability
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- Knapsack Problems for Wreath Products
- SUBGROUPS OF FINITELY PRESENTED GROUPS WITH SOLVABLE CONJUGACY PROBLEM
- The SQ-universality of hyperbolic groups
- The conjugacy problem and Higman embeddings
- Rational subsets of unitriangular groups
- Knapsack problems in groups
- On Embedding Groups and the Conjugacy Problem
- Unsolvable Problems in Groups With Solvable Word Problem
- Knapsack in hyperbolic groups
This page was built for publication: Decidability problem for exponential equations in finitely presented groups