Asymptotic formula for packing progressions of intermediate length

From papers

Let mk(n)m_k(n) denote the packing number for progressions with parameter kk. Intermediate-length packing conjecture. For every kk satisfying Ω(n)=k<n\Omega(\sqrt{n})=k<\sqrt{n}, we have

mk(n)(1k23n)klnkn.m_k(n)\sim \left(1-\frac{k^2}{3n}\right)\frac{k}{\ln k}\cdot n.

The source identifies this as the remaining case after the conjecture for m(n)m(n) would settle the range knk\geq\sqrt n; it is left open.

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

Noga Alon, Michał Dębski, Jarosław Grytczuk and Jakub Przybyło, “Packing arithmetic progressions”, arXiv:2603.02786 (2026).

Solutions 0

No solutions have been posted yet.