Erdős Problem #95 — The squared multiplicities of planar distances
Let be a set of distinct points, and let be the distinct positive distances determined by pairs of points of . For each , define the multiplicity
where pairs are unordered. The question is whether, for every fixed , there are constants and such that for every and every such ,
Background
This squared-multiplicity quantity is an equal-distance energy: it counts pairs of point-pairs that realize the same distance. It is closely connected to the classical distinct-distances problem, which asks how few different distances an -point planar set can determine. Erdős posed that problem in 1946; the square lattice provides a construction with on the order of distinct distances, motivating his conjecture that this order is minimal. Distinct Distances: Open Problems and Current Bounds (arXiv:1406.1949)
The connection is made by Cauchy–Schwarz: since , if is the number of distinct distances, then
Thus an upper bound for the energy yields a lower bound for the number of distinct distances. Conversely, large energy records extensive repetition among distances. On the Erdős distinct distance problem in the plane (arXiv:1011.4105)
References
P. Erdős, Some of my favourite problems in number theory, combinatorics, and geometry, Resenhas 2 (1995), 165–186.
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 0
No solutions have been posted yet.