Finiteness conjecture for binomial near collisions of fixed difference

From papers

A binomial near collision is a quadruple (n,k,m,l)(n,k,m,l) with 2kn/22\leq k\leq n/2, 2lm/22\leq l\leq m/2, and

(ml)(nk)=d>0,\binom{m}{l}-\binom{n}{k}=d>0,

with (ml)d3\binom{m}{l}\geq d^3. Here dd is the positive difference between the two binomial coefficients.

Fixed-difference finiteness conjecture. Given a fixed difference dd, the number of near collisions with difference dd is finite.

This generalizes the preceding difference-one completeness conjecture from a classification claim to a finiteness claim for every fixed positive difference. The source provides no proof or resolution.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Aart Blokhuis, Andries Brouwer and Benne de Weger, “Binomial collisions and near collisions”, arXiv:1707.06893 (2017).

Solutions 0

No solutions have been posted yet.