Orientable quadratic equations in free metabelian groups
classification
🧮 math.GR
keywords
decidableequationsfreegroupsmetabelianorientableproblemquadratic
read the original abstract
We prove that the Diophantine problem for orientable quadratic equations in free metabelian groups is decidable and furthermore, NP-complete. In the case when the number of variables in the equation is bounded, the problem is decidable in polynomial time.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.