Orientable quadratic equations in free metabelian groups

DOI10.1016/J.JALGEBRA.2021.04.013MaRDI QIDQ6300433arXivFDO

Authors Igor Lysenok, Alexander Ushakov

Publication date 16 April 2018

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Solvable groups, supersolvable groups (20F16)

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 page was built for publication: Orientable quadratic equations in free metabelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6300433)