Erdős Problem #1083 — Distinct distances in fixed-dimensional spaces
Let be an integer and . For a set of distinct points, define its set of pairwise distances by
Define
Thus is the least number of distinct distances that can be forced for every such . For each fixed , estimate as ; in particular, is
Background
This is the higher-dimensional version of the distinct-distance problem. Erdős’s 1946 work established the bounds . The upper bound comes from lattice points: an approximately cubic section of with about points has squared distances given by sums of squares, with each summand at most on the order of . The question emphasizes fixed dimension as grows; the lattice construction suggests the scale for the minimum. Erdős (1946) arXiv:1406.1949
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
Claimed by OpenAI.See full solution
Claims that for every fixed integer d >= 3 there is c_d > 0 such that every set of n >= 2 distinct points in R^d determines at least c_d n^(2/d) distances; the bound has no spacing or position assumptions and implies the target's weaker asymptotic lower bound.
Repository: https://github.com/openai/math
- OpenAI-166-01-The-higher-dimensional-Erd-s-distinct-distances-conjecture.pdfOpen