Improved Bounds for Pencils of Lines
Abstract
We consider a question raised by Rudnev: given four pencils of n concurrent lines in R2, with the four centres of the pencils non-collinear, what is the maximum possible size of the set of points where four lines meet? Our main result states that the number of such points is O(n11/6), improving a result of Chang and Solymosi. We also consider constructions for this problem. Alon, Ruzsa and Solymosi constructed an arrangement of four non-collinear n-pencils which determine (n3/2) four-rich points. We give a construction to show that this is not tight, improving this lower bound by a logarithmic factor. We also give a construction of a set of m n-pencils, whose centres are in general position, that determine m(n3/2) m-rich points.
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.