Olga Kharlampovich, Laura Lopez, Alexei Miasnikov
Published 2019-03-24Version 1
In this paper we show that Diophantine problem in solvable Baumslag-Solitar groups $BS(1,k)$ is decidable, i.e., there is an algorithm that given a finite system of equations with constants in $BS(1,k)$ decides whether or not the system has a solution in the group.
Diophantine problems in solvable groups
Metabelian groups: full-rank presentations, randomness and Diophantine problems
Quadratic equations in metabelian Baumslag-Solitar groups
![QR code for arXiv:1903.10068 [math.GR]](http://oss.arxitics.com/images/favicon.svg)