Absolute bounds for rational Diophantine tuples

Definitions and mathematical statement

Shared notation.

$\mathbb N=\{1,2,\ldots\}$, and $\mathbb Z,\mathbb Q,\mathbb R,\mathbb C$ denote the integers, rationals, reals and complex numbers. Any other conventions are specified locally.

For $q\in\mathbb Q$, a rational $D(q)$-$m$-tuple is a set $A=\{a_1,\ldots,a_m\}\subset\mathbb Q\setminus\{0\}$ of distinct numbers such that $a_i a_j+q$ is a square in $\mathbb Q$ for every $i<j$. Elements may have either sign; zero squares are allowed.

Statement recorded in the supplied source.

Is there a constant $M\in\mathbb N$ such that every rational $D(1)$-tuple has cardinality at most $M$? [S2]

Short English statement

Is there one absolute bound on the size of all rational Diophantine tuples?

Sources

• S1 ULAM.AI and the UnsolvedMath Contributors, UnsolvedMath: A Curated Collection of Open Mathematics Problems, record 8500001 (AMR-084-0001). CC BY 4.0. https://huggingface.co/datasets/ulamai/UnsolvedMath.
• S2 Andrej Dujella, Diophantine m-tuples, author-maintained survey (snapshot accessed 9 October 2026), Chapter 1, Definition 1.2 and paragraph on rational upper bounds. https://raw.githubusercontent.com/dujella/dujella.github.io/master/intro.html.