On differences and sums of integers. I (Q1256507): Difference between revisions

A set \(B=\{b_1,b_2,\ldots,b_i\}\subset\{1,2,\ldots,N\}\) is a difference intersector set if for any set \(A=\{a_1,a_2,\ldots,a_j\}\subset\{1,2,\ldots,N\}\), \(j=\varepsilon N\) the equation \(a_x - a_y=b\) has a solution. The notion of a sum intersector set is defined similarly. Using exponential sum techniques, the authors prove two theorems which in essence imply that a set which is well-distributed within and amongst all residue classes of small modules is both a difference and a sum intersector set. The regularity of the distribution of the non-zero quadratic residues \((bmod p)\) allows the theorems to be used to investigate the solubility of the equations \[ \left(\frac{a_x - a_y}{p}\right)=+1, \ \left(\frac{a_r - a_s}{p}\right) = -1, \ \left(\frac{a_t - a_u}{p}\right) = +1, \text{ and }\left(\frac{a_v - a_w}{p}\right) = -1. \] The theorems are also used to establish that ``almost all'' sequences form both difference and sum intersector sets.