English

Sets of Rich Lines in General Position

Combinatorics 2014-07-31 v2

Abstract

Given a set of nn points in R2R^2, the Szemer\'edi-Trotter theorem establishes that the number of lines which can be incident to at least k>1k > 1 of these points is O(n2/k3+n/k)O(n^2/k^3 + 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\epsilon > 0 there exists some δ>0\delta > 0 such that for sufficiently large values of nn, every set of lines in general position, each intersecting an n×nn \times n grid of points in at least n1δn^{1-\delta} places, has size at most nϵn^\epsilon.

Keywords

Cite

@article{arxiv.1310.6707,
  title  = {Sets of Rich Lines in General Position},
  author = {G. Amirkhanyan and A. Bush and E. Croot and C. Pryby},
  journal= {arXiv preprint arXiv:1310.6707},
  year   = {2014}
}

Comments

A few corrections; some material added at the end. Submitted