English

An explicit incidence theorem in F_p

Combinatorics 2014-01-14 v2

Abstract

Let P=A×AFp×FpP = A\times A \subset \mathbb{F}_p \times \mathbb{F}_p, pp a prime. Assume that P=A×AP= A\times A has nn elements, n<pn<p. See PP as a set of points in the plane over Fp\mathbb{F}_p. We show that the pairs of points in PP determine cn1+1/267\geq c n^{1 + {1/267}} lines, where cc is an absolute constant. We derive from this an incidence theorem: the number of incidences between a set of nn points and a set of nn lines in the projective plane over \Fp\F_p (n<pn<\sqrt{p}) is bounded by Cn3/21/10678C n^{{3/2}-{1/10678}}, where CC is an absolute constant.

Keywords

Cite

@article{arxiv.1001.1980,
  title  = {An explicit incidence theorem in F_p},
  author = {Harald Andres Helfgott and Misha Rudnev},
  journal= {arXiv preprint arXiv:1001.1980},
  year   = {2014}
}

Comments

11 pages

R2 v1 2026-06-21T14:33:49.201Z