On Diophantine equations over $\mathbb Z[i]$ with $52$ unknowns

In this paper we show that there is no algorithm to decide whether an arbitrarily given polynomial equation $P(z_1,\ldots,z_{52})=0$ (with integer coefficients) over the Gaussian ring $\mathbb Z[i]$ is solvable.

No reviews yet.

No comments yet.