On Diophantine equations over mathbb Z[i] with 52 unknowns
Reviewed by Pithpith:SAJN56YYopen to challenge →
classification
math.NT
math.LO
keywords
mathbbalgorithmarbitrarilycoefficientsdecidediophantineequationequations
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.