Wiki
Wiki

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 mm, there is an NN-point set in Rm\mathbb R^m with at least N2N^2 unit squares, where

k=⌊m2⌋,N=(m2k).k=\left\lfloor\frac{\sqrt m}{2}\right\rfloor, \qquad N=\binom m{2k}.

Full proof

For 1≤k≤m/41\le k\le m/4, let SkS_k consist of the vectors with exactly 2k2k coordinates equal to 1/2k1/\sqrt{2k} and all others zero. It has (m2k)\binom m{2k} points. Choose four disjoint kk-element coordinate sets A,B,C,DA,B,C,D. The four vertices whose supports are

A∪B,B∪C,C∪D,D∪AA\cup B,\quad B\cup C,\quad C\cup D,\quad D\cup A

form a unit square: adjacent vectors differ on 2k2k coordinates and opposite vectors differ on 4k4k coordinates, giving side one and diagonal 2\sqrt2.

A resulting square recovers its four blocks as the intersections of consecutive supports. It is therefore counted exactly eight times among ordered choices of A,B,C,DA,B,C,D, once for each cyclic starting position and direction. Consequently the number of these squares is

Q=18(mk)(m−kk)(m−2kk)(m−3kk)=18(m2k)(m−2k2k)(2kk)2.\begin{aligned} Q&=\frac18\binom mk\binom{m-k}k\binom{m-2k}k\binom{m-3k}k\\ &=\frac18\binom m{2k}\binom{m-2k}{2k}\binom{2k}k^2. \end{aligned}

The ratio to N2N^2 satisfies

QN2=18(∏j=02k−1m−2k−jm−j)(2kk)2.\frac Q{N^2} =\frac18\left(\prod_{j=0}^{2k-1}\frac{m-2k-j}{m-j}\right)\binom{2k}k^2.

For k=⌊m/2⌋k=\lfloor\sqrt m/2\rfloor, the product tends to e−1e^{-1}. Indeed its logarithm is

∑j=02k−1log⁡(1−2km−j)=−4k2m+O(k3/m2)⟶−1.\sum_{j=0}^{2k-1}\log\left(1-\frac{2k}{m-j}\right) =-\frac{4k^2}{m}+O(k^3/m^2)\longrightarrow-1.

To justify the error, for 0≤u≤1/20\le u\le1/2 the convergent logarithm series gives ∣log⁡(1−u)+u∣≤u2|\log(1-u)+u|\le u^2; all summands have that range for sufficiently large mm. Replacing 1/(m−j)1/(m-j) by 1/m1/m contributes O(k3/m2)O(k^3/m^2) as well. Thus the product eventually exceeds 1/31/3. Also (2kk)≥2k→∞\binom{2k}k\ge2^k\to\infty, since each factor (k+j)/j(k+j)/j for 1≤j≤k1\le j\le k is at least two. Eventually Q/N2>(2kk)2/24≥1Q/N^2>\binom{2k}k^2/24\ge1.

The source gives an intermediate lower comparison for the product in the opposite direction: each factor (m−2k−j)/(m−j)(m-2k-j)/(m-j) is at most (m−2k)/m(m-2k)/m, 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.