Solymosi's general-position conjecture for rich lines in grids

About 9 years old · traced to

Let F\mathbb{F} be a field, let 0<α≤10<\alpha\leq 1, and let a line ℓ\ell in F2\mathbb{F}^2 be α\alpha-rich in a Cartesian product Y×YY\times Y if

∣ℓ∩(Y×Y)∣≥α∣Y∣.|\ell\cap (Y\times Y)|\geq \alpha|Y|.

A set of lines is in general position if no two lines are parallel and no three lines pass through a common point. Solymosi's conjecture. Among the lines that are α\alpha-rich in a N×NN\times N Cartesian product, at most C=C(α)>0C=C(\alpha)>0 can be in general position. The conjecture concerns the inverse problem for rich-line incidences: it asserts that, absent structure among the lines, a grid supports only boundedly many rich lines. The paper disproves it with explicit examples over Q\mathbb{Q}, C\mathbb{C}, and Fp\mathbb{F}_p, so the conjecture is refuted.

References

Primary source

Brendan Murphy, “Upper and lower bounds for rich lines in grids”, arXiv:1709.10438 (2018).

Progress summary

Refreshed
Claimed solved

A 2017 paper gives explicit counterexamples, showing that the conjecture is false over the rationals, complex numbers, and prime finite fields.

The conjecture predicts a bound depending only on α\alpha for rich lines in general position in an N×NN\times N grid. A September 2017 paper claims to refute it by constructing unbounded families.

Known results

  • October 2013: over R\mathbb{R}, sufficiently many lines with at least n1−δn^{1-\delta} grid points force two parallel lines or three concurrent lines; this is weaker than a constant bound.
  • The same 2013 work gives the equivalent formulation for arbitrary A⊆RA\subseteq\mathbb{R} with ∣A∣=n|A|=n.

September 2017 counterexample

The paper Upper and lower bounds for rich lines in grids claims that, for fixed 0<α<10<\alpha<1, over Q\mathbb{Q} the number of rich lines in general position is at least C(1−α)log⁡N/log⁡log⁡NC(1-\alpha)\log N/\log\log N. It also gives explicit constructions over C\mathbb{C} and Fp\mathbb{F}_p, thereby claiming a refutation in all stated settings.

Current status (as of September 2026): The conjecture has a claimed explicit refutation from 2017; no later source in the record overturns it, but this automated summary does not independently verify the proof.

Sources

Solutions 0

No solutions have been posted yet.