Corrected Guy–Kelly asymptotic conjecture for the no-three-in-line problem

From papers

Let SnS_n be the set of n2n^2 points in R2\mathbb{R}^2 with integer coordinates (x,y)(x,y) satisfying 1x,y<n1\leq x,y<n, and let fnf_n be the maximum size of a subset of SnS_n containing no three collinear points. Corrected Guy–Kelly conjecture. As nn tends to infinity,

fn(π3)n.f_n\sim \left(\frac{\pi}{\sqrt{3}}\right)n.

This is the corrected conjectured upper-bound asymptotic arising from Gabor Ellmann's correction to the Guy–Kelly heuristic; the source contrasts it with the original constant (2π2/3)1/3\left(2\pi^2/3\right)^{1/3} and notes that a derivation of the corrected bound appeared in recent work of Prellberg.

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

Paul M Voutier, “On the Guy-Kelly Conjecture for the No-Three-In-Line Problem”, arXiv:2603.00215 (2026).

Solutions 0

No solutions have been posted yet.