Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Notation (p. 5-01). For a set of non-negative integers, is its ordinary-difference set, the non-negative integers that are differences of two elements of .
Theorem 8 (p. 5-07). Let be a non-constant polynomial with integer coefficients and positive, and put . Then for every set of positive upper density if and only if for every integer there is an integer with . (The print reuses the letter for the degree and for the integer in the divisibility condition, and says "every integer " here; the deduction before the theorem works with every positive integer .)
Remarks (pp. 5-07 to 5-08). The result is obvious for polynomials of degree
- A monic with an integer root has the property, so in particular the -th powers do for every positive integer . The reducible polynomial , with , and integers that are not squares, has the property, since it has a linear factor modulo every . An irreducible of degree at least 2 does not, since by a theorem of Frobenius it has no linear factor modulo some prime . By Theorem 3, may be replaced by in the statement (p. 5-08).
Proof pointer
P. 5-07, in outline. Necessity is the congruence condition of p. 5-06: if divides no value of , the multiples of form a set of positive density whose difference set misses . Sufficiency combines Kamae and Mendès France's criterion (if, for every positive integer , the elements of divisible by , taken in increasing order and multiplied by any irrational , are uniformly distributed modulo 1, then meets every with of positive upper density) with the uniform distribution modulo 1 of and of , cited from Kuipers and Niederreiter (Theorem 3.2, p. 27, and Theorem 2.1, p. 238); the condition that divides some value of makes the multiples of in a non-empty union of such classes.
Read depth
Claims checked: Theorem 8 and the remarks after it were read clause by clause on the page images of the print, and the outline of the deduction on p. 5-07 was followed. The Kamae-Mendès France criterion and the uniform-distribution inputs are cited, not proved, in the survey and were not checked.
Dependencies
Theorem 3 for the form. External input: Kamae and Mendès France, Van der Corput's difference theorem (Israel J. Math., then to appear), Example 3 and Theorem 2; Kuipers and Niederreiter, Uniform distribution of sequences (1974), Theorem 3.2 (p. 27) and Theorem 2.1 (p. 238).
Source. Cam L. Stewart, On difference sets of sets of integers, Séminaire Delange-Pisot-Poitou, Théorie des nombres, 19e année (1977/78), Fasc. 1, Exp. No. 5, 8 pp.; pages are cited by the print's own numbering 5-01 to 5-08, as on the source card.
Bears on
No Erdős problem page of the corpus cites this theorem.