Improved Bounds for Pencils of Lines
Combinatorics
2018-05-24 v1 Number Theory
Abstract
We consider a question raised by Rudnev: given four pencils of concurrent lines in , 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 , 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 -pencils which determine 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 -pencils, whose centres are in general position, that determine -rich points.
Keywords
Cite
@article{arxiv.1805.09188,
title = {Improved Bounds for Pencils of Lines},
author = {Oliver Roche-Newton and Audie Warren},
journal= {arXiv preprint arXiv:1805.09188},
year = {2018}
}