betaFeedback

WorksMathematics

Z\mathbb Z is diophantine over Q\mathbb Q with 26 unknowns

Abstract

Recently, OpenAI proved that Hilbert's Tenth Problem over the field Q\mathbb Q of rational numbers has a negative solution. Motivated by this work, G. Conant et al. showed that Z\mathbb Z is diophantine over Q\mathbb Q, i.e., there is an integer-coefficient polynomial F(x,y1,…,yn)F(x,y_1,\ldots,y_n) such that for any x∈Qx\in\mathbb Q we have x∈Z  ⟺  ∃ y1,…,yn∈Q [F(x,y1,…,yn)=0]. x\in\mathbb Z\quad\iff \exists\,y_1,\ldots,y_{n}\in\mathbb Q\ [F(x,y_1,\ldots,y_{n})=0]. They constructed such a polynomial FF with °F=4°F=4 and n=221n=221.In this paper, we prove the existence of such a polynomial FF with n=26n=26. We also show that 1616 existential unknowns suffice under the abcabc-conjecture.

Paper details

vlnc:W_ann2rapr
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…