2018/04/17 by Lysenok, Igor, Ushakov, Alexander · 1 citation
#FOS: Mathematics #Group Theory (math.GR)
paper · doi:10.48550/arxiv.1804.06018
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.