Orientable quadratic equations in free metabelian groups

Igor Lysenok, Alexander Ushakov

Research output: Contribution to journalArticlepeer-review

5 Scopus citations

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 languageEnglish
Pages (from-to)303-326
Number of pages24
JournalJournal of Algebra
Volume581
DOIs
StatePublished - 1 Sep 2021

Keywords

  • Diophantine problem
  • Free metabelian group
  • NP-completeness
  • Quadratic equation

Fingerprint

Dive into the research topics of 'Orientable quadratic equations in free metabelian groups'. Together they form a unique fingerprint.

Cite this