arXiv (All)
open access
86 unknowns for Hilbert's tenth problem over the rationals
Recently, Hilbert's Tenth Problem over the field $\mathbb Q$ of rational numbers was solved negatively by OpenAI based on a five-contact height estimate and a pole-parity construction. In this paper, we prove further that there is no algorithm to decide for any polynomial $f(x_1,\ldots,x_{86})$ with
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the rational points in conics of a cubic surface#1200840
- GCD and ABC inequalities for abelian varieties over function fields#1355305
- A Proof of the Third Borwein Conjecture#1156091
- VO EXTENSION#237186
- On the Hilbert depth of a special class of squarefree monomial ideals#1217520
Record · ID 1355680
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive