Proof reducing the undecidability threshold for Diophantine equations over Z[i] to 18 variables via a new gadget and integer conditions.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.NT 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An AI Proof of 18-Variable Undecidability for Diophantine Equations over $\mathbb Z[i]$
Proof reducing the undecidability threshold for Diophantine equations over Z[i] to 18 variables via a new gadget and integer conditions.