An absolute bound for the size of Diophantine \(m\)-tuples (Q1597955)

A set of distinct positive integers \(\{a_1,a_2, \dots,a_m\}\) is called a Diophantine \(m\)-tuple if \(a_ia_j+1\) is a perfect square for all pairs \((i,j)\) with \(1\leq i<j\leq m\). The Diophantine quadruple \(\{1,3,8,120\}\) is attributed to Fermat, and a well-known conjecture is that Diophantine quintuples do not exist. In the present paper the author shows that, given a Diophantine triple \(\{a,b,c\}\) that satisfies the gap condition \(b>4a\) and \(c>\max \{b^{13}, 10^{20}\}\) or \(c>\max \{b^5,10^{1029}\}\), then there is a unique integer \(d>c\) such that \(\{a,b,c,d\}\) is a Diophantine quadruple. He uses this result to prove that Diophantine 9-tuples cannot exist, and that there can only be finitely many Diophantine 8-tuples. The proofs make use of gap principles, the simultaneous rational approximation of algebraic numbers, and the lower bounds for linear forms in logarithms.