Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint

DOI10.1016/j.jalgebra.2020.12.007zbMath1462.20014OpenAlexW3112819292MaRDI QIDQ827048

V. G. Durnev, O. V. Zetkina, A. I. Zetkina

Publication date: 6 January 2021

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgebra.2020.12.007

zbMATH Keywords

word problemequations in free groupsalgorithmic undecidability

Mathematics Subject Classification ID

Generators, relations, and presentations of groups (20F05) Nilpotent groups (20F18) Free nonabelian groups (20E05) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quadratic equations over free groups and free products
• On systems of equations over free products of groups.
• Elementary theory of free non-abelian groups.
• Quadratic equations over small cancellation groups
• On equations in free semigroups and groups
• Generators of the group \(F/[N,N\)]
• On the solvability problem for equations with a single coefficient
• Combinatorial group theory.
• Pseudosymmetric equations in a free monoid.
• Implicit function theorem over free groups.
• Some properties of a Magnus embedding
• Undecidable theories
• Unsolved Problems in Group Theory. The Kourovka Notebook
• Equations over groups
• EQUATIONS IN A FREE GROUP
• Solving one-variable equations in free groups
• DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
• ON SYSTEMS OF EQUATIONS IN A FREE GROUP
• Equations in Free Groups
• SYSTEMS OF EQUATIONS IN A FREE GROUP. I
• SYSTEMS OF EQUATIONS IN A FREE GROUP. II
• Quadratic equations in hyperbolic groups are NP-complete
• Varieties of groups
• One-Variable Equations in Free Groups
• On the Substitution Problem for Free Groups
• On braid groups

This page was built for publication: Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint