English

Products of Differences over Arbitrary Finite Fields

Combinatorics 2018-11-15 v3 Number Theory

Abstract

There exists an absolute constant δ>0\delta > 0 such that for all qq and all subsets AFqA \subseteq \mathbb{F}_q of the finite field with qq elements, if A>q2/3δ|A| > q^{2/3 - \delta}, then (AA)(AA)={(ab)(cd):a,b,c,dA}>q2. |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| > \frac{q}{2}. Any δ<1/13,542\delta < 1/13,542 suffices for sufficiently large qq. This improves the condition A>q2/3|A| > q^{2/3}, due to Bennett, Hart, Iosevich, Pakianathan, and Rudnev, that is typical for such questions. Our proof is based on a qualitatively optimal characterisation of sets A,XFqA,X \subseteq \mathbb{F}_q for which the number of solutions to the equation (a1a2)=x(a3a4),  a1,a2,a3,a4A,xX (a_1-a_2) = x (a_3-a_4) \, , \; a_1,a_2, a_3, a_4 \in A, x \in X is nearly maximum. A key ingredient is determining exact algebraic structure of sets A,XA, X for which A+XA|A + XA| is nearly minimum, which refines a result of Bourgain and Glibichuk using work of Gill, Helfgott, and Tao. We also prove a stronger statement for (AB)(CD)={(ab)(cd):aA,bB,cC,dD} (A-B)(C-D) = \{ (a -b) (c-d) : a \in A, b \in B, c \in C, d \in D\} when A,B,C,DA,B,C,D are sets in a prime field, generalising a result of Roche-Newton, Rudnev, Shkredov, and the authors.

Keywords

Cite

@article{arxiv.1705.06581,
  title  = {Products of Differences over Arbitrary Finite Fields},
  author = {Brendan Murphy and Giorgis Petridis},
  journal= {arXiv preprint arXiv:1705.06581},
  year   = {2018}
}

Comments

42 pages

R2 v1 2026-06-22T19:51:18.931Z