English

On grids in point-line arrangements in the plane

Combinatorics 2020-06-23 v2

Abstract

The famous Szemer\'{e}di-Trotter theorem states that any arrangement of nn points and nn lines in the plane determines O(n4/3)O(n^{4/3}) incidences, and this bound is tight. In this paper, we prove the following Tur\'an-type result for point-line incidence. Let L1\mathcal{L}_1 and L2\mathcal{L}_2 be two sets of tt lines in the plane and let P={12:1L1,2L2}P=\{\ell_1 \cap \ell_2 : \ell_1 \in \mathcal{L}_1, \ell_2 \in \mathcal{L}_2\} be the set of intersection points between L1\mathcal{L}_1 and L2\mathcal{L}_2. We say that (P,L1L2)(P, \mathcal{L}_1 \cup \mathcal{L}_2) forms a \emph{natural t×tt\times t grid} if P=t2|P| =t^2, and conv(P)conv(P) does not contain the intersection point of some two lines in Li,\mathcal{L}_i, for i=1,2.i = 1,2. For fixed t>1t > 1, we show that any arrangement of nn points and nn lines in the plane that does not contain a natural t×tt\times t grid determines O(n43ε)O(n^{\frac{4}{3}- \varepsilon}) incidences, where ε=ε(t)\varepsilon = \varepsilon(t). We also provide a construction of nn points and nn lines in the plane that does not contain a natural 2×22 \times 2 grid and determines at least Ω(n1+114)\Omega({n^{1+\frac{1}{14}}}) incidences.

Keywords

Cite

@article{arxiv.1812.11162,
  title  = {On grids in point-line arrangements in the plane},
  author = {Mozhgan Mirzaei and Andrew Suk},
  journal= {arXiv preprint arXiv:1812.11162},
  year   = {2020}
}

Comments

13 pages, 5 figures