The Szemerédi-Trotter type theorem and the sum-product estimate in finite fields (Q648974): Difference between revisions

In this paper the author improves a result of \textit{V. H. Vu} [Math. Res. Lett. 15, No. 2--3, 375--388 (2008; Zbl 1214.11021)] and \textit{D. N. Hart}, \textit{A. Iosevich} and \textit{J. Solymosi} [Int. Math. Res. Not. 2007, No. 5, Article ID rnm007, 14 p. (2007; Zbl 1146.11013)] by proving the following sum-product estimates: If \(A \subset \mathbb{F}_{p}\), where \(q\) is an odd prime power and \(q^{1/2} << |A| \leq q^{2/3}\), then \(\max(|A + A|, |A \cdot A|) \geq c\frac{|A|^{2}}{q^{1/2}}\). Moreover, if \(q^{2/3} \leq |A| << q\), then \(\max(|A + A|, |A \cdot A|) \geq c(q|A|^{1/2})\). To obtain these estimations the author proves a Szemerédi-Trotter type theorem which gives an upper bound to the number of incidences between points and lines in finite field geometries. The proof of the theorem use graph theoretic tools.