On Diophantine equations over $\mathbb Z[i]$ with $52$ unknowns
Number Theory
2021-02-02 v3 Logic
Abstract
In this paper we show that there is no algorithm to decide whether an arbitrarily given polynomial equation (with integer coefficients) over the Gaussian ring is solvable.
Cite
@article{arxiv.2002.12136,
title = {On Diophantine equations over $\mathbb Z[i]$ with $52$ unknowns},
author = {Yuri Matiyasevich and Zhi-Wei Sun},
journal= {arXiv preprint arXiv:2002.12136},
year = {2021}
}
Comments
6 pages, update a reference