By @josebrox

50fcd5d / CITATION.cff

Raw
cff-version: 1.2.0
message: "Please cite the relevant theorem paper and computational specification, and cite the underlying arithmetic sources separately."
type: software
title: "Polynomial presentations of the integers over the rationals"
authors:
  - name: "ℤℚ Diophantine Project contributors"
repository-code: "https://github.com/JoseBrox/diophantine-z-q_improvements"
url: "https://github.com/JoseBrox/diophantine-z-q_improvements"
date-released: 2026-11-19
version: "2026.11.19-v80"
license: CC-BY-4.0
abstract: >-
  Mathematical proofs and exact specifications for polynomial presentations
  of the integers over the rationals, under explicitly stated arithmetic
  premises. Current constructions use 25 variables with degree at most
  87778394112, or 165 variables with degree four. Fully specified
  constructions use 27 variables with degree at most 335647080448, or
  180 quartic variables with 59084 canonical ASCII bytes. Ordinary rational
  abc gives an 11-variable family of degree at most 6361985 and a
  58-variable quartic family. All counts include the input. Sufficient
  parameters for the existence families remain ineffective. The reductions
  193 to 165, 229 to 180, 68 to 62 and 13 to 11 are based on notes of Gabe
  Conant with Astra 6.2; subsequent project audits and extensions are
  separately identified, including the subsequent reductions from 62 to 59 to 58.
  The latest quartic uses Burungale Theorem B in its stated square class.
  Global rational realization for the 21/9 targets
  remains unproved. A complete independent audit of retained arithmetic
  foundations is not asserted. Cite the project and this repository as
  specified in the README Contributors and citation subsection.
keywords:
  - Diophantine definitions
  - Hilbert's tenth problem
  - rational points
  - explicit polynomials
  - elliptic heights
  - finite algebraic elimination
  - number fields