By @josebroxSourceGitHub
Fork
Clone
git clone https://github.com/JoseBrox/diophantine-z-q_improvements.git
Cite
Version link
https://openversions.com/josebrox/diophantine-z-q-improvements/commit/15552b47d96f52359b3560b7965ddf3af97fda26
Version identifier (commit hash)
15552b47d96f52359b3560b7965ddf3af97fda26

Fork to create your own copy with credit to the source. Clone to get a Git copy on your computer.

Earlier version

Checks complete

Reduce the ordinary-abc quartic from 62 to 59 variables Use one derivative contact, a rational normalizer valid at both signs of odd valuation, and a quadratic derivative circuit without cubic-power registers. Supply the complete 51-quadratic and 873-monomial specifications, independent coefficient reconstruction, source-map audit, proof review, and exact parameter qualifications. Retain all named arithmetic premises in addition to ordinary rational abc. Credit the source notes of Gabe Conant with Astra 6.2 throughout the current presentation and affected manuscripts. Simplify the README to one ordinary-abc quartic and one unrestricted-degree abc result. Preserve the original review receipts through exact reverse attribution edits and fresh typesetting review. Keep the 25-, 165-, 180- and 11-variable records unchanged. Add a narrowly scoped integral-weight parity obstruction and independent normalization checks for all ten general-quartic pole blocks. Extend CI with the v79 gate while retaining every historical regression check.

Committed

Claims

Findings

Headline finding

The repository provides complete proofs and exact computational specifications for integer polynomials F(X,Y1,…,Ym)F(X,Y_1,\ldots,Y_m) whose rational input projection is the integers, under the arithmetic premises stated in each construction.

Unverified

README.md is an overview document; the actual proofs in the referenced TeX manuscripts and the computational specifications in the referenced JSON/Python files are not provided in the supplied text.

The v79 continuation reduces the ordinary-abc quartic from 62 to 59 total variables, achieving degree 4 (exact), 51 quadratic squares, 873 monomials, and exact coefficient height max⁡(22838305425411,B2+4092)\max(22838305425411, B^2+4092) for every positive integer BB, where every sufficiently large fixed odd BB is defining under its stated premises (with an ineffective threshold).

Unverified

The proof in papers/quartic_existence/single_derivative59_20261119_v79.tex and the polynomial/quadric files are not included in the provided document.

The general few-variable family achieves 25 total variables and degree ≤87,778,394,112\le 87,778,394,112 with no additional height hypothesis beyond the retained arithmetic premises, using a four-contact scalar and projective two-root encoder with an ineffective sufficient odd exponent.

The general quartic family achieves 165 total variables, exact degree 4, 139 quadratic squares, 2,607 monomials, and exact coefficient height H(FN)=max⁡{126616122944180358034867798936,  1492N+2}H(F_N)=\max\{126616122944180358034867798936,\;149^{2N+2}\} for N≥1N\ge 1, with an ineffective defining threshold and no additional height hypothesis.

The fully specified general polynomial achieves 27 total variables, degree ≤335,647,080,448\le 335,647,080,448, explicit L=143L=143, and coefficient height <2246< 2^{2^{46}}, with no additional height hypothesis.

The fully specified quartic achieves 180 total variables, exact degree 4, 152 quadratic squares, 2,850 monomials, and 108-bit exact coefficient height 206625078319751697390503348692624, with no additional height hypothesis.

The few-variable family under ordinary rational abc achieves 11 total variables and degree ≤6,361,985\le 6,361,985, using twelve contacts at the first height scale with an ineffective sufficient fixed odd shift.

A proved parity obstruction rules out one proposed full-pair compression in the retained integral Laurent chart, without establishing a lower bound for arbitrary quartics.

Methods

Four-contact scalar and projective two-root encoder for constructing few-variable polynomial presentations.

Source excerpts

“Four-contact scalar and projective two-root encoder; sufficient odd exponent ineffective.” · Show in paper

Twelve contacts at the first height scale for constructing few-variable polynomial presentations conditional on ordinary rational abc.

Source excerpts

“Twelve contacts at the first height scale; sufficient fixed odd shift ineffective.” · Show in paper

Computational verification using Python 3.12 and SymPy 1.14.0 to reconstruct exact identities, guards, coefficient tables, and finite certificates in temporary directories.

Source excerpts

“The verifiers reconstruct exact identities, guards, coefficient tables and finite certificates in temporary directories.” · Show in paper

Research files

Commit by @josebrox

Code files

Other files

Polynomial presentations of the integers over the rationals

Complete proofs and exact computational specifications for integer polynomials

F(X,Y1,…,Ym)F(X,Y_1,\ldots,Y_m)

whose rational input projection is the integers, under the arithmetic premises stated in each construction.

Every variable count includes the input. Degree means total degree. Coefficient height is the maximum absolute integer coefficient after the fixed parameters have been substituted. We optimize variable count, then degree, then coefficient height. No global minimum is claimed.

Current constructions — 19 November 2026

The reductions 193→165, 229→180, 68→62 and 13→11 come from notes of Gabe Conant with Astra 6.2. They have been audited and integrated here, with further degree, coefficient and hypothesis improvements. The source audit distinguishes those contributions from the subsequent work. The v79 continuation further reduces the ordinary-abc quartic from 62 to 59 variables.

“None” in the height-hypothesis column means no additional conjecture beyond the arithmetic premises explicitly retained in the proof. A complete independent audit of all inherited elliptic, prime-pattern, pole-realization and height foundations has not been established.

ConstructionAdditional height hypothesisTotal variablesDegreeCoefficients and effectiveness
General few-variable familyNone25≤ 87,778,394,112Four-contact scalar and projective two-root encoder; sufficient odd exponent ineffective.
General quartic familyNone1654, exact139 quadratic squares; 2,607 monomials; defining threshold ineffective.
Fully specified general polynomialNone27≤ 335,647,080,448Explicit L=143; coefficient height < 2^(2^46).
Fully specified quarticNone1804, exact152 quadratic squares; 2,850 monomials; 108-bit exact height.
Few-variable family under abcOrdinary rational abc11≤ 6,361,985Twelve contacts at the first height scale; sufficient fixed odd shift ineffective.
Quartic family under abcOrdinary rational abc594, exact51 quadratic squares; 873 monomials; sufficient fixed odd shift ineffective.

The unrestricted-degree bounds describe complete finite determinant specifications; those enormous polynomials have not been fully expanded. All displayed quartics are exactly expanded. Every construction has integer content one, with primitive normalization where needed. Small coefficient fixtures and coefficient-height cutoffs are not sufficient defining parameters.

The results JSON records the exact specifications, source assumptions and parameter qualifications. Weaker fixed-exponent versions of abc and alternative coefficient presentations are retained in the detailed proof guide.

Coefficients and explicit files

The general quartic family has exact coefficient height

H(FN)=max⁡{126616122944180358034867798936,  1492N+2},N≥1.H(F_N)=\max\{126616122944180358034867798936,\;149^{2N+2}\},\qquad N\ge1.

A sufficient defining N exists under the retained premises, but its value is ineffective. The fully specified quartic has exact coefficient height 206625078319751697390503348692624. Its expanded polynomial occupies 59,084 ASCII bytes. The sparser presentation from Gabe Conant with Astra 6.2 is also retained: 54,695 bytes and a larger 161-bit height.

The 59-variable conditional quartic has exact height max(22838305425411,B²+4092) for every positive integer B; every sufficiently large fixed odd B is defining under its stated premises. The threshold is ineffective. Its expanded coefficient table, quadratic equations, and independent reconstruction are supplied. The previous 62-variable coefficient presentations remain in the v78 package.

Contributors and citation

This repository belongs to the ℤℚ Diophantine Project, which uses the collective agentic notes from Stefan Baranczuk, Jose Brox, Gabe Conant, Sohail Farhangi, James Freitag, Elliot Glazer, Jennifer Park, and Caroline Terry. The main repository for the project is Elliot Glazer's.

This repository includes updated results and more related work: polynomial witnesses of unrestricted degree but lower number of variables, results conditional on the abc conjecture, etc.

Cite this work as "ℤℚ Diophantine Project contributors. ℤ is Diophantine in ℚ. 2026. https://github.com/elliotglazer/diophantine-z-q". If you want to include any of the related results specific to this repository, please add "https://github.com/JoseBrox/diophantine-z-q_improvements" to the end of the reference.

Source attribution

The new shared-product quartics, positive-factor encodings, weak-abc single-pole construction and related realization notes were supplied in Gabe Conant's notes with Astra 6.2, in H10-quartic-constructions.zip and H10-eleven-variable-constructions.zip. The attribution record identifies the original material and subsequent audit work. The supplied source bytes and checksum lists are preserved.

The earlier 198-variable archive retains its own Gabriel Conant and ChatGPT attribution. The arithmetic inputs include the separately identified Sun, Jaswal and Burungale results and the supplied simultaneous-twist strengthening. Their exact statements, versions, use and review limitations are recorded in arithmetic inputs, the individual proofs and THIRD_PARTY.md.

Original project contributions are under CC BY 4.0. Third-party material retains its rights and attribution. See CONTRIBUTING.md and CITATION.cff.

Open reductions and proved obstructions

The counts 25, 165, 180 and 11 remain unchanged in this continuation. A proved parity obstruction rules out one proposed full-pair compression in the retained integral Laurent chart; it does not establish a lower bound for arbitrary quartics.

The complete general and conditional 21/9-variable targets remain unproved. The main unresolved step is global rational realization at the actual elliptic detector values, with every physical lift and denominator condition satisfied. Local solubility, a rational point on an auxiliary cover, and successful finite searches do not establish that step.

The research directions, actual-trace criteria, physical-lift checkpoint, and reference-normalization theorem give precise formulations. Proved obstructions exclude specified constructions and specializations; they do not establish a global lower bound on the number of variables.

For number fields, the definability reductions relate the ring of integers, the rational integers and the rational subfield. No counterexample to Diophantine definability for a number field, or theorem covering every number field, is established here.

Historical results

The historical results JSON and dated proof guides preserve superseded constructions and their full checks. Historical numerical bounds apply to their named sources, rather than the current table.

  • v65, v66 and v67: earlier quartic constructions and point-coordinate audits.
  • v68 and its canonical polynomial package: the preceding fully expanded explicit quartic.
  • v69 and v70: source audits, trace arithmetic and geometric obstructions.
  • v71, v72, v73, v74 and v75: enlarged point charts, reconstructed quartics and even-valuation improvements.

Reproduction

Use Python 3.12 and SymPy 1.14.0. From the repository root:

python -m pip install sympy==1.14.0
python -B scripts/verify_v79.py --report /tmp/v79-verification.json
python -B scripts/verify_v78.py --report /tmp/v78-verification.json
python -B scripts/verify.py --full --receipt /tmp/legacy-verification.json

The full current sequence, including every intervening regression gate, is specified in the CI workflow. The reproducibility guide describes source restoration, coefficient formats and optional arithmetic checks.

The verifiers reconstruct exact identities, guards, coefficient tables and finite certificates in temporary directories. Their receipts identify what was checked. Computational reconstruction does not prove the external arithmetic premises or constitute independent non-author mathematical review. Optional PARI checks are not included in --full unless explicitly requested.

The complete TeX manuscripts are the mathematical deliverables. Affected papers are compiled and visually inspected before publication; scripts/update_manifest.py records the distributed file hashes.