Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Source: original paper, printed p. 541, Theorem 9.
Statement
For all sufficiently large integers , there is an -point set in with at least unit squares, where
Full proof
For , let consist of the vectors with exactly coordinates equal to and all others zero. It has points. Choose four disjoint -element coordinate sets . The four vertices whose supports are
form a unit square: adjacent vectors differ on coordinates and opposite vectors differ on coordinates, giving side one and diagonal .
A resulting square recovers its four blocks as the intersections of consecutive supports. It is therefore counted exactly eight times among ordered choices of , once for each cyclic starting position and direction. Consequently the number of these squares is
The ratio to satisfies
For , the product tends to . Indeed its logarithm is
To justify the error, for the convergent logarithm series gives ; all summands have that range for sufficiently large . Replacing by contributes as well. Thus the product eventually exceeds . Also , since each factor for is at least two. Eventually .
The source gives an intermediate lower comparison for the product in the opposite direction: each factor is at most , rather than greater. The direct logarithmic estimate above proves the same needed limit for the actual product, so the construction and final sufficiently-large conclusion are retained without relying on that comparison.