Bipartite Diophantine Tuples: Bounds & Techniques

• Bipartite Diophantine tuples are defined by two natural number subsets A and B where every product ab shifted by n yields a perfect k-th power, generalizing classical Diophantine m-tuples.
• Sharp quantitative bounds are established using methods like the gap principle and sieve techniques, revealing logarithmic limits on minimal set sizes and power-saving estimates on product sizes.
• The framework extends to multipartite settings, offering insights into conditional results under the ABC conjecture and posing open problems in arithmetic geometry.

A bipartite Diophantine tuple with property $BD_k(n)$ consists of two finite subsets $A, B \subseteq \mathbb{N}$ (with $|A|, |B| \geq 2$), such that for all $a \in A$ and $b \in B$, the shifted product $ab + n$ is a perfect $k$-th power in $\mathbb{N}$. This bipartite notion generalizes classical Diophantine $m$-tuples and, in recent work, provides a unifying framework for bounding the size and structure of various Diophantine-type sets and their shifted higher-power analogues (Tsang et al., 3 Dec 2025, Yip, 2023).

1. Definition and Notation

Let $k \geq 2$ and $A, B \subseteq \mathbb{N}$0 be fixed integers. Denote $A, B \subseteq \mathbb{N}$1 as the set of positive integers. A pair $A, B \subseteq \mathbb{N}$2 of finite subsets of $A, B \subseteq \mathbb{N}$3, each with cardinality at least 2, is a bipartite Diophantine tuple with property $A, B \subseteq \mathbb{N}$4 if

$A, B \subseteq \mathbb{N}$5

In symbols: $A, B \subseteq \mathbb{N}$6 This structure interpolates between classical Diophantine tuples ($A, B \subseteq \mathbb{N}$7) and various generalized settings, including shifted and higher-power cases.

2. Quantitative Bounds and Structural Results

Yip establishes sharp unconditional upper bounds on both the cardinalities and product sizes of bipartite Diophantine tuples.

Let $A, B \subseteq \mathbb{N}$8. As $A, B \subseteq \mathbb{N}$9,

$|A|, |B| \geq 2$0

where $|A|, |B| \geq 2$1 is Euler’s totient function with an absolute implied constant (Yip, 2023).

For larger minimal block sizes, define $|A|, |B| \geq 2$2. For explicit thresholds $|A|, |B| \geq 2$3 ($|A|, |B| \geq 2$4 for $|A|, |B| \geq 2$5): $|A|, |B| \geq 2$6 with $|A|, |B| \geq 2$7 and, for $|A|, |B| \geq 2$8,

$|A|, |B| \geq 2$9

When $a \in A$0 and $a \in A$1, one obtains the power-saving bound $a \in A$2.

3. Generalizations and Conditional Results

A significant generalization of the Bugeaud–Dujella theorem extends from the classical $a \in A$3 case to arbitrary nonzero shifts. If $a \in A$4 and for $a \in A$5, all $a \in A$6 ($a \in A$7) are perfect $a \in A$8-th powers, then for any $a \in A$9,

$b \in B$0

For $b \in B$1, the bound is $b \in B$2 (Tsang et al., 3 Dec 2025).

On a conditional basis (assuming the ABC conjecture), minimal sizes $b \in B$3 can be determined such that any bipartite $b \in B$4 tuple with $b \in B$5 has $b \in B$6 bounded as a function of $b \in B$7 and $b \in B$8:

$b \in B$9

Explicit power-saving bounds under ABC are established for these regimes, using simultaneous Pell-type equations and inductive bootstrapping with the gap principle.

4. Connections to Other Diophantine Structures

Bipartite Diophantine tuples serve as a central notion linking numerous variants and extensions:

• Strongly $ab + n$0-Diophantine Sets (Banks–Luca–Szalay): For a fixed $ab + n$1, a set $ab + n$2 is strongly $ab + n$3-Diophantine if all shifted subset-products $ab + n$4. The construction reduces questions about large strongly Diophantine sets to bipartite $ab + n$5 tuples using partitions of subset products.
• Kihel–Kihel $ab + n$6-sets: A set $ab + n$7 is a $ab + n$8-set if, for every $ab + n$9-element subset $k$0, $k$1 is a perfect $k$2-th power. Tsang–Yip make bounds explicit by partitioning the $k$3 products into two blocks to produce a bipartite $k$4-tuple. The resulting bound: $k$5 giving explicit finiteness results for $k$6-sets.

5. Auxiliary Techniques

The proof strategies employ a range of Diophantine, combinatorial, and sieve-theoretic tools:

• Gap Principle: If $k$7 and $k$8 with all $k$9 perfect $\mathbb{N}$0-th powers, then $\mathbb{N}$1; repeated application yields super-exponential growth unless set sizes are small.
• Thue–Siegel/Evertse Bounds: Used to control large solutions to $\mathbb{N}$2.
• Stepanov’s Method over $\mathbb{N}$3: Bounding the cardinalities of product sets in shifted multiplicative subgroups modulo primes.
• Gallagher’s Larger Sieve: Ensures that $\mathbb{N}$4 for $\mathbb{N}$5 within $\mathbb{N}$6.

These methods interact to establish both unconditional and conditional bounds on the size and product of the tuples.

6. Examples and Applications

• Classical Diophantine Quadruples: E.g., $\mathbb{N}$7 split as $\mathbb{N}$8, as a $\mathbb{N}$9 pair.
• Hilbert Cubes in Shifted Powers: A multiplicative Hilbert cube $m$0 contained in $m$1 yields, after partitioning, a bipartite tuple; the bounds imply $m$2 for $m$3.

An explicit unconditional bound for $m$4 (squares) gives $m$5 when $m$6 and $m$7 for $m$8.

7. Open Problems and Directions for Further Research

• The general case for $m$9 (shifted squares) remains unresolved: it is conjectured that for each $k \geq 2$0, there exists an absolute constant $k \geq 2$1 such that any $k \geq 2$2-tuple has $k \geq 2$3. Confirmed only for small shifts $k \geq 2$4.
• Eliminate dependence on the ABC conjecture, potentially via sharper Thue bounds or uniformity results from arithmetic geometry.
• Refine the exponents in all power-saving bounds.
• Investigate “multipartite” Diophantine tuples involving more than two subsets.
• Analyze analogues over number fields, function fields, and finite fields, where different sum–product behaviors arise.
• Study effective and algorithmic enumeration of large $k \geq 2$5-tuples for fixed small $k \geq 2$6 and $k \geq 2$7.

Bipartite Diophantine tuples thus unify and control multiple classical and recent extensions in the theory of Diophantine tuples, serving as a versatile device in modern research on multiplicative and shifted Diophantine problems (Tsang et al., 3 Dec 2025, Yip, 2023).