Orientable quadratic equations in free metabelian groups
Group Theory
2018-04-18 v1
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.
Keywords
Cite
@article{arxiv.1804.06018,
title = {Orientable quadratic equations in free metabelian groups},
author = {Igor Lysenok and Alexander Ushakov},
journal= {arXiv preprint arXiv:1804.06018},
year = {2018}
}