Monochromatic no-three-in-line asymptotics

From papers

Let Dmono(n)D_{\mathrm{mono}}(n) denote the exact maximum number of points in a monochromatic no-three-in-line configuration on the checkerboard grid of side length nn, and let α\alpha be the middle real root of

401α31744α2+2240α768=0.401\alpha^3-1744\alpha^2+2240\alpha-768=0.

Monochromatic NTIL asymptotics. The exact monochromatic no-three-in-line maxima satisfy

limnDmono(n)n=α.\lim_{n\to\infty}\frac{D_{\mathrm{mono}}(n)}{n}=\alpha.

This is stronger than the corresponding relaxation asymptotics: the finite LP computations motivate it, while the continuum certificate gives an exact upper bound only for the odd-fat relaxation. The discrete limit remains unproved.

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

Thomas Prellberg, “No-three-in-line sets on the checkerboard grid”, arXiv:2605.09215 (2026).

Solutions 0

No solutions have been posted yet.