FIGURATE: Diophantine Tuples of Figurate Numbers
Research status (10 November 2026): Continuing research programme, launched as a bounded pilot on 3 November 2026. Multiple bounded mathematical results have since been internally proved, tested and admitted through protected repository processes, including uniform Type B obstruction and construction families and exact ray-class arithmetic. This is not an independent MATHCERT certification, a claim of literature priority or a complete classification.
A square number can be drawn as a square array of dots; a triangular number as a triangle. Mathematicians call these figurate numbers. The FIGURATE pilot asks how difficult it is to assemble collections of positive integers when every pair obeys a figurate-number constraint.
This page is an accessible companion to the exact research specification. The programme distinguishes three mathematical types (A, B and C), which must not be conflated.
The mathematical end-game
The ultimate question is when figurate Diophantine tuples exist, when they cannot exist, and what arithmetic principle separates those outcomes. For each clearly specified polygonal order, offset and tuple type, the aspiration is an exact existence criterion or a theorem covering an infinite parameter family. Complete unrestricted classification is a research ambition, not an announced theorem or guaranteed outcome.
The active WP09 research track concentrates on Type B: distinct positive entries whose pairwise products, after adding a fixed offset, are polygonal numbers. The mathematical results guide records both rigorous nonexistence conditions and genuine infinite construction families. The latest advances use conductor-sensitive oriented ray classes to prove uniform target-class realization for selected families and, in WP09-034, to decide exactly when a particular explicit Pell-unit orbit reaches the required ray for any specified odd conductor. This orbit test is not a general classification of all norm ideals.
From modular tests to an existence theorem
- Local arithmetic: prove which congruence restrictions are necessary, using binary and odd-prime-power conditions. Local compatibility alone is not a solution.
- Global construction: transform the remaining integer conditions into constrained Pell equations; prove genuine positive-index solutions when possible.
- Ideal-class arithmetic: for the recurring anchor \(k=16m+4\) and offset \(c=2\), interpret the global condition using ideals of the actual quadratic order and their oriented ray classes.
- Decisive realization test: determine whether an ideal of the required norm actually represents the required ray class. Calculating the ray-class group does not establish that such an ideal exists.
- Uniform conclusion: use a proved target-class realization or obstruction to obtain an infinite parameter-family theorem for positive-integer triples or their nonexistence.
Progress through WP09-034: WP09-031 computes full oriented ray-class groups for odd square conductors. WP09-032/033 give infinite positive Type B constructions for powers of 3 and all \(f=3^a5^b7^c>1\), respectively. WP09-034 proves a prime-general, exact valuation-and-CRT criterion for one explicit norm-representative unit orbit, extending successful positive families to all prime powers of 11, 13, 17, 19, 23 and 31 (among others), plus compatible mixed conductors. When the criterion succeeds, the pair \((1,2f^2)\) at order \(k=2f^2+2\), offset 2, has infinitely many positive exact Type B extensions. When it fails, only that selected Pell-unit orbit is ruled out, not Type B existence in general.
Next proposed theorem target: when the prime-general orbit criterion fails, analyze other norm ideals and Pell orbits rather than infer global nonexistence. A key test case is the incompatible selected orbit at conductor 219: its failure does not rule out another successful ideal. Seek a genuine local-to-global obstruction only after complete norm-fibre evidence; extend beyond square conductors and fixed first pairs as theorems permit.
The longer programme must separately address Type A (figurate entries with square pairwise outputs) and Type C (both entry and output restrictions). The active Type B results do not automatically imply results for either.
Results and mathematical explanation
Read the mathematical guide: Figurate tuples—existence, obstruction and global arithmetic.
The results guide begins with elementary, uniform nonexistence theorems from congruences (including octagonal examples), then covers odd-prime-power local tests, exact integer construction families, Pell reductions and the ideal/ray-class programme, infinite prime-power and mixed-conductor existence results, and the prime-general orbit criterion through WP09-034. It separates each verified theorem from the stronger, still-open global existence and classification claims. Mathematical originality and independent specialist certification remain unverified; repository admission does not certify them.
Research completion and remaining obligations
The bounded-pilot closure reconciliation records the initial work-package acceptances and the distinct original-source fidelity gap. The continuing WP09 tracker records later protected research and public admissions. WP09-032/033 prove explicit infinite global-existence families, and WP09-034 gives a complete test for one specified global norm orbit; none closes the unrestricted Type B local-to-global problem or FIGURATE. The original 2025 article is not yet source-audited in full, and independent mathematical certification and literature novelty remain unresolved.
What is a figurate number?
The polygonal number of order \(k\) at index \(t\) is
For \(k=3\), the values are triangular numbers \(1,3,6,10,15,\ldots\). For \(k=4\), the values are squares \(1,4,9,16,25,\ldots\). For \(k=5\), the values are pentagonal numbers \(1,5,12,22,35,\ldots\).
Two mathematically different kinds of tuple
Type A: figurate entries. Every member of the tuple is figurate, and the product of any distinct pair, plus a fixed integer \(n\), is a square:
Type B: figurate pairwise outputs. The tuple entries are arbitrary distinct positive integers, but the product of any pair plus a fixed integer \(c\) must be a figurate number:
Type C imposes both a figurate-entry constraint and figurate pairwise outputs. The polygonal order and offsets must be explicitly declared for each experiment.
A result for one type is not automatically a result for another.
Two examples
The classical Diophantine quadruple \(\{1,3,8,120\}\) has the property that each pairwise product plus \(1\) is a square: the resulting values are \(4,9,121,25,361,961\). Because squares are polygonal numbers of order \(4\), it is also a Type B example with \(k=4,c=1\).
The triple \(\{1,2,27\}\) is a Type B triangular example with \(k=3,c=1\), because
Neither example is a newly discovered GCL result.
Why the problem connects to Pell equations
Membership in a polygonal sequence can be transformed into a constrained square equation:
For Type B, substitute \(P_k(t)=ab+c\). A square discriminant is a useful search filter, but is not on its own sufficient: the recovered polygonal index must be positive and integral, including the required sign and divisibility constraints.
Requiring every pair in a tuple to satisfy its own equation couples several quadratic equations. This makes extension of a triple to a quadruple a nontrivial arithmetic question.
What was known before FIGURATE?
In August 2026, Sounak Bagchi and Christian Zhou-Zheng studied Type A triangular \(D(n)\) tuples. They proved that no Type A triangular \(D(1)\) quadruple exists, exhibited an infinite triple family, and conjectured that their family describes every triangular \(D(1)\) triple. They also proved that Type A triangular \(D(n)\) pairs do not exist for \(n\) congruent to \(2\) or \(5\) modulo \(9\). See their paper.
In July 2026, Alan Filipin, Ana Jurasić and Alain Togbé studied Type B triangular \(D(n)\) sets. They proved that the specified pairs \(\{k,2k\}\) for \(k=10\) and \(k=28\) cannot be extended to a quadruple. The conclusion is not a blanket prohibition on Type B triangular quadruples. See the journal article.
The earlier and wider literature includes triangular-set extension results and other Diophantine tuples. Andrej Dujella's bibliography is a reference locator, not a substitute for checking theorem statements against original sources. The novelty audit is still open.
What GCL has implemented
The current MATHSOLVE exact-arithmetic census enumerates compatible tuples with distinct positive entries bounded by a declared maximum, explicit polygonal order, offset and tuple size. It produces deterministic JSON with pairwise integer witnesses and performs no floating-point computation.
Regression tests compare selected small cases against independent brute-force enumeration. The baseline was admitted in MATHSOLVE PR #1175; this is engineering admission, not mathematical certification.
Reproduce the baseline from a MATHSOLVE checkout:
python3 -m unittest discover -s tests -p test_figurate_census.py
python3 -m research.figurate_census --kind B --k 3 --offset 1 --limit 100 --size 3
The limit is the maximum entry value, not the maximum figurate index. Exhaustive output within declared bounds never establishes global nonexistence.
Original four pilot work packages
The list below describes the initial November 3 pilot architecture, not a count of current work packages. Later work through WP09 is tracked separately.
- WP01: sources and novelty. Pin original literature, separate definitions, confirm open conjectures and record prior constructions and exclusions.
- WP02: computational census. Run reproducible, independently checked surveys over polygonal orders and offsets; record costs, exact bounds and witness hashes.
- WP03: arithmetic obstructions. Develop modular residue exclusions and simultaneous Pell-type reductions with precisely proved hypotheses.
- WP04: theorem attempt. Seek a genuinely new parameter-uniform obstruction, a new infinite construction or a rigorous algorithmic result. Route substantive claims through the appropriate mathematical review and certification process.
The bounded pilot has produced source-linked proof dossiers and exact computations; the larger programme continues because the general existence/classification objective remains open. Internal mathematical results are not by themselves a novelty determination or external certification.
Documentary library
The core documentary records serve distinct purposes:
- Source-critical bibliography and novelty ledger: precise distinctions between published theorems, conjectures, offset-specific restrictions and new research questions.
- Reproducible bounded census: full parameter domain, the 270-row archive, exact replay and finite-search limitations.
- Research preprint, version 0.1: an earlier arXiv-style methods draft, not an automatically updated account of later WP09 results or a submitted article.
- Current mathematical results and synthesis: what is proved, how the evidence relates and which global realization theorem is still missing.
- Bounded-pilot closure reconciliation: accepted early deliverables versus outstanding primary-source and certification obligations.
Evidence, governance and continuity
- Canonical FIGURATE pilot charter, MATH-PROGRAMME #3093
- Continuing Type B research and protected WP09 evidence, #3145
- Latest full square-conductor oriented ray-group dossier, WP09-031
- Uniform power-of-three target-ray realization and Type B infinite-family proof, WP09-032
- WP09-033: uniform mixed 3/5/7 conductor realization and exact Type B triples
- WP09-034: prime-general unit valuation, generalized CRT and exact orbit-scope obstruction criterion
- MATHSOLVE source specification
- Protected implementation and checks, PR #1175
- Research source and regression tests
Continuity boundary: Initial charter and computational baselines, multiple bounded Type B mathematical dossiers and public explanations are protected-admitted. The general WP09 target-class realization and wider parameter-classification questions remain active despite the proven prime-power and mixed-conductor existence families; the primary-source fidelity gap and independent MATHCERT certification remain separate. This overview reports programme direction and admitted evidence; it does not assert a universal existence theorem, a public priority determination or live-site deployment verification.