Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
For vectors let and . Theorem 1. Every set of distinct vectors has . More precisely, for some the vectors , , take at least distinct values (the paper indexes this set by , a slip for ).
The paper adds (p. 2): "Perhaps such a lower bound holds in higher dimension." The example (1), , is a translate of the Freiman–Lev set (with , ), and their general sets with and have , of size (pp. 2--3); the paper concludes: "Thus the lower bound in Theorem 1 is best possible up to a factor of " (p. 3).
Source. A. Granville and F. Roesler, The set of differences of a given set, Amer. Math. Monthly 106 (1999), no. 4, 338--344; Theorem 1 on p. 2 of the author preprint and the Freiman–Lev sets on pp. 2--3, read on the page images; the proof is on p. 4 of the preprint and was not read for this page. The journal version was not compared.
Read depth. Claims checked: the statement and the two paragraphs around it were read clause by clause on the page images. The proof was not read; the count for the Freiman–Lev sets is the paper's.
Proof pointer
Page 4 of the preprint, in section 2, which also proves Theorem 4; the paper presents the proof as Sudakov's. Not read here.
Dependencies
None stated in the theorem.
Bears on
- Problem 539: sets of integers built from two fixed primes give at least ratios , and the Freiman–Lev sets show that , the site's credited to Freiman and Lev. The thread's fixed-prime exponents and for three and four primes are Holzman, Lev and Pinchasi's (2008), not this paper's.