arXiv Analytics

Sign in

arXiv:2002.12136 [math.NT]AbstractReferencesReviewsResources

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

Yuri Matiyasevich, Zhi-Wei Sun

Published 2020-02-24Version 1

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.

Comments: Submitted to Proc. of the 2019 Asian Logic Conf.; 5 pages
Categories: math.NT, math.LO
Subjects: 03D35, 11U05, 03D25, 11B39, 11D99, 11R11
Related articles: Most relevant | Search more
arXiv:2409.02933 [math.NT] (Published 2024-08-21)
A Pair of Diophantine Equations Involving the Fibonacci Numbers
Xuyuan Chen et al.
arXiv:2103.08302 [math.NT] (Published 2021-03-09)
Mixed quantifier prefixes over Diophantine equations with integer variables
arXiv:2312.07986 [math.NT] (Published 2023-12-13)
On Diophantine equations with Fibonacci and Lucas sequences associated to Hardy-Ramanujan problem

Links

Toolbox