[Paper Review] Products of Differences over Arbitrary Finite Fields

Thomas Brendan Murphy, Giorgis Petridis|Bristol Research (University of Bristol)|May 18, 2017

Limits and Structures in Graph Theory34 references3 citations

TL;DR

This paper establishes that for any finite field $\mathbb{F}_q$, if a subset $A \subseteq \mathbb{F}_q$ has size $|A| > q^{2/3 - \delta}$ for some absolute $\delta > 0$, then the product set $(A-A)(A-A)$ has size greater than $q/2$. The proof relies on a refined analysis of solutions to the equation $(a_1 - a_2) = x(a_3 - a_4)$, using character sum estimates and Pl"{u}nnecke-type inequalities to improve the threshold below $q^{2/3}$, extending prior results in sum-product theory over finite fields.

ABSTRACT

There exists an absolute constant $δ> 0$ such that for all $q$ and all subsets $A \subseteq \mathbb{F}_q$ of the finite field with $q$ elements, if $|A| > q^{2/3 - δ}$, then \[ |(A-A)(A-A)| = |\{ (a -b) (c-d) : a,b,c,d \in A\}| > \frac{q}{2}. \] Any $δ< 1/13,542$ suffices for sufficiently large $q$. This improves the condition $|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,X \subseteq \mathbb{F}_q$ for which the number of solutions to the equation \[ (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, X$ for which $|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 \[ (A-B)(C-D) = \{ (a -b) (c-d) : a \in A, b \in B, c \in C, d \in D\} \] when $A,B,C,D$ are sets in a prime field, generalising a result of Roche-Newton, Rudnev, Shkredov, and the authors.

Motivation & Objective

• To improve the known threshold $|A| > q^{2/3}$ for the product set $(A-A)(A-A)$ to be large in finite fields.
• To establish a quantitative improvement in the sum-product phenomenon for the polynomial $(w-x)(y-z)$ over arbitrary finite fields.
• To refine the understanding of sets $A, X \subseteq \mathbb{F}_q$ for which the number of solutions to $(a_1 - a_2) = x(a_3 - a_4)$ is nearly maximal.
• To extend results on product sets to arbitrary finite fields, not just prime fields, by overcoming limitations of prior incidence-theoretic methods.
• To determine the exact algebraic structure of sets $A, X$ for which $|A + XA|$ is nearly minimal, refining earlier work of Bourgain and Glibichuk.

Proposed method

• Analyzes the number of solutions to the equation $(a_1 - a_2) = x(a_3 - a_4)$ with $a_i \in A$, $x \in X$, to characterize extremal sets.
• Uses character sum estimates and Pl"{u}nnecke-type inequalities to bound the size of the set $\Omega$ of witnesses to large product sets.
• Applies a popularity principle and averaging argument to identify pairs $(a, a')$ in $A \times A$ with large intersection in solution sets $B_a \cap B_{a'}$.
• Employs double-counting techniques on the sumset $A + A_1B$ with $A_1$ of relative density $\gtrsim 1/K^2$ in $A$ to derive size bounds.
• Combines Pl"{u}nnecke's inequality for different summands with a refined version of the completion method to control the growth of $|A + XA|$.
• Leverages results from Gill, Helfgott, and Tao on product sets in finite fields to refine the structure of sets with small doubling.

Experimental results

Research questions

• RQ1 Can the threshold $|A| > q^{2/3}$ for the product set $(A-A)(A-A)$ to have size $> q/2$ be improved in arbitrary finite fields?
• RQ2 What is the exact algebraic structure of sets $A, X \subseteq \mathbb{F}_q$ for which $|A + XA|$ is nearly minimal?
• RQ3 How can the number of solutions to $(a_1 - a_2) = x(a_3 - a_4)$ be used to characterize extremal sets in finite fields?
• RQ4 Can the completion method be refined to achieve better bounds below the $q^{2/3}$ threshold in non-prime finite fields?
• RQ5 To what extent can incidence geometry techniques used in prime fields be extended to arbitrary finite fields in the context of product sets?

Key findings

• For any $\delta < 1/13,542$, if $|A| > q^{2/3 - \delta}$, then $|(A-A)(A-A)| > q/2$ holds over any finite field $\mathbb{F}_q$.
• The paper improves the threshold from $q^{2/3}$ to $q^{2/3 - \delta}$, with $\delta$ absolute and positive, for the product of differences in arbitrary finite fields.
• The proof establishes a qualitative characterization of sets $A, X$ for which the number of solutions to $(a_1 - a_2) = x(a_3 - a_4)$ is nearly maximal.
• It refines the structure of sets with small doubling $|A + XA|$ by showing such sets must have a specific algebraic form, extending work of Bourgain and Glibichuk.
• The method yields a stronger result for $|(A-B)(C-D)|$ when $A,B,C,D$ are subsets of a prime field, generalizing earlier results of Roche-Newton, Rudnev, Shkredov, and others.
• The authors achieve a quantitative improvement by using a refined double-counting argument involving $A_1$ of density $\gtrsim 1/K^2$ in $A$, leading to a bound $|A \pm A_1B| \lesssim K^5 K_0^2 |A_1|$.