Sets of Rich Lines in General Position
Abstract
Given a set of n points in R2, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least k > 1 of these points is O(n2/k3 + n/k). J.\ Solymosi conjectured that if one requires the points to be in a grid formation and the lines to be in general position---no two parallel, no three meeting at a point---then one can get a much tighter bound. We prove: for every ε > 0 there exists some δ > 0 such that for sufficiently large values of n, every set of lines in general position, each intersecting an n × n grid of points in at least n1-δ places, has size at most nε.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.