Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated


A projective plane of order qq has q2+q+1q^2+q+1 points and lines, with q+1q+1 lines through each point, and exactly one line through two distinct points. For a set SS of size ss, put xℓ=∣S∩ℓ∣x_\ell=|S\cap\ell|. Double counting gives

∑ℓxℓ=s(q+1),∑ℓxℓ(xℓ−1)=s(s−1).\sum_\ell x_\ell=s(q+1),\qquad \sum_\ell x_\ell(x_\ell-1)=s(s-1).

If 1≤xℓ≤C1\le x_\ell\le C, then xℓ(xℓ−1)≤C(xℓ−1)x_\ell(x_\ell-1)\le C(x_\ell-1). Summing and rearranging proves

s2−[C(q+1)+1]s+C(q2+q+1)≤0.s^2-[C(q+1)+1]s+C(q^2+q+1)\le0.

Any cap at most three also satisfies the hypotheses with C=3C=3. In that case the discriminant is −3q2+12q+4-3q^2+12q+4, which is negative at q=5q=5 and strictly decreasing for real q≥5q\ge5. The monic quadratic is positive for every real ss, a contradiction. The plane over the field of five elements exists, so a cap working for every finite plane cannot be less than four: a real bound below four permits at most three points on a line.

For C=4C=4 the discriminant is 24q+924q+9, giving the interval on the claim page. A necessary interval does not supply a point set attaining it.