Bounds for the size of sets with the property D(n)
From MaRDI portal
Publication:4662136
Abstract: Let n be a nonzero integer and a_1 < a_2 < ... <a_m positive integers such that a_i*a_j + n is a perfect square for all 1 <= i < j <= m. It is known that m <= 5 for n = 1. In this paper we prove that m <= 31 for |n| <= 400 and m < 15.476 log|n| for |n| > 400.
Recommendations
Cited in
(19)- The sizes of the classes of H(N)-sets
- Diophantine tuples over \(\mathbb{Z}_p\)
- A bound on the overlap of same-sized subsets
- Diophantine quadruples with the properties \(D(n_1)\) and \(D(n_2)\)
- A POLYNOMIAL VARIANT OF A PROBLEM OF DIOPHANTUS FOR PURE POWERS
- Diophantine quadruples in \(\mathbb{Z}[i][X]\)
- The Paley graph conjecture and Diophantine \(m\)-tuples
- On the existence of \(D(-3)\)-quadruples over \(\mathbb{Z}\)
- On the largest element in \(D(n)\)-quadruples
- A natural lower bound for the size of nodal sets
- Explicit constructions of Diophantine tuples over finite fields
- The size of Max\((p)\) sets and density bases.
- On the size of the set \(A(A + 1)\)
- The extension of the \(D(-k)\)-pair \(\{k,k+1\}\) to a quadruple
- Triples which are D(n)-sets for several n's
- Diophantine \(m\)-tuples for linear polynomials. II: Equal degrees
- A polynomial variant of diophantine triples in linear recurrences
- There is no Diophantine D(−1)$D(-1)$‐quadruple
- AN EFFECTIVE BOUND FOR GENERALISED DIOPHANTINE m-TUPLES
This page was built for publication: Bounds for the size of sets with the property D(n)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4662136)