Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Statement
Theorem 2. For each , a set of distinct vectors for which is minimal satisfies
Here with , and "minimal" means minimal over all -sets of distinct vectors (of any dimension), so is the least value in the vector form of the paper's Unsolved problem, the of Problem 539 (the paper gives it no symbol). The paper presents the theorem as "the following partial result concerning our unsolved problem", obtained "from these remarks, combined with those directly above the statement of Theorem 1" (p. 3): the upper estimate is the size of for the Freiman–Lev sets in the plane and the lower estimate is the pairing argument of p. 2.
Source. A. Granville and F. Roesler, The set of differences of a given set, Amer. Math. Monthly 106 (1999), no. 4, 338--344; Theorem 2 on p. 3 of the author preprint, read on the page image; its two inputs on pp. 2--3. The journal version was not compared.
Read depth. Claims checked: the statement and the sentence introducing it were read clause by clause on the page image; the lower bound's argument was followed on p. 2 and is complete as printed; the count for the Freiman–Lev sets is the paper's and was not redone.
Proof pointer
Combination of the lower-bound paragraph on p. 2 (recorded on the Unsolved problem page) with the Freiman–Lev sets of pp. 2--3 (recorded on the Theorem 1 page).
Dependencies
The size count for the Freiman–Lev sets (the paper's, credited to Freiman and Lev without a reference).
Bears on
- Problem 539: in the site's notation , the two refereed bounds the site's commentary credits to Erdős–Szemerédi and to Freiman–Lev, saying that a proof of both can be found in this paper. The 2026 upper bound attributed on the site to an automated proof system replaces the exponent by through sets in growing dimension.