您当前的位置: > 详细浏览

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

请选择邀稿期刊:
摘要: Recently, OpenAI proved that Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers has a negative solution. Motivated by this work, G. Conant et al. showed that $\mathbb Z$ is diophantine over $\mathbb Q$, i.e., there is an integer-coefficient polynomial $F(x,y_1,\ldots,y_n)$ such that for any $x\in\mathbb Q$ we have 
$$ 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 $F$ with $\deg F=4$ and $n=221$.  In this paper, we prove the existence of such a polynomial $F$ with $n=26$.

版本历史

[V1] 2026-11-13 07:47:34 ChinaXiv:202611.00103V1 下载全文
点击下载全文
预览
同行评议状态
待评议
许可声明
metrics指标
  •  点击量1379
  •  下载量316
评论
分享
申请专家评阅