The diophantine problem in some metabelian groups

Olga Kharlampovich, Laura López, Alexei Myasnikov

Research output: Contribution to journalArticlepeer-review

11 Scopus citations

Abstract

In this paper we show that the Diophantine problem in solvable Baumslag-Solitar groups BS(1, k) and in wreath products A | Z, where A is a finitely generated abelian group and Z is an infinite cyclic group, is decidable, i.e., there is an algorithm that, given a finite system of equations with constants in such a group, decides whether or not the system has a solution in the group.

Original languageEnglish
Pages (from-to)2507-2519
Number of pages13
JournalMathematics of Computation
Volume89
Issue number325
DOIs
StatePublished - 2020

Fingerprint

Dive into the research topics of 'The diophantine problem in some metabelian groups'. Together they form a unique fingerprint.

Cite this