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.
Original language | English |
---|---|
Pages (from-to) | 303-326 |
Number of pages | 24 |
Journal | Journal of Algebra |
Volume | 581 |
DOIs | |
State | Published - 1 Sep 2021 |
Keywords
- Diophantine problem
- Free metabelian group
- NP-completeness
- Quadratic equation