English

Pinned distance sets, Wolff's exponent in finite fields and improved sum-product estimates

Classical Analysis and ODEs 2007-11-30 v1 Combinatorics

Abstract

An analog of the Falconer distance problem in vector spaces over finite fields asks for the threshold α>0\alpha>0 such that Δ(E)q|\Delta(E)| \gtrsim q whenever Eqα|E| \gtrsim q^{\alpha}, where EFqdE \subset {\Bbb F}_q^d, the dd-dimensional vector space over a finite field with qq elements (not necessarily prime). Here Δ(E)={(x1y1)2+...+(xdyd)2:x,yE}\Delta(E)=\{{(x_1-y_1)}^2+...+{(x_d-y_d)}^2: x,y \in E\}. The second listed author and Misha Rudnev established the threshold d+12\frac{d+1}{2}, and the authors of this paper, Doowon Koh and Misha Rudnev proved that this exponent is sharp in even dimensions. In this paper we improve the threshold to d22d1\frac{d^2}{2d-1} under the additional assumption that EE has product structure. In particular, we obtain the exponent 4/3, consistent with the corresponding exponent in Euclidean space obtained by Wolff.

Keywords

Cite

@article{arxiv.0711.4597,
  title  = {Pinned distance sets, Wolff's exponent in finite fields and improved sum-product estimates},
  author = {Derrick Hart and Alex Iosevich},
  journal= {arXiv preprint arXiv:0711.4597},
  year   = {2007}
}