Erdős Problem #1082 — Distinct Distances from Points in General Position
Let be a finite set of distinct points, with no three distinct points of collinear. Write
for the number of distinct distances determined by pairs in . The first question is whether every such satisfies
Erdős Problems #1082 Distinct Distances: Open Problems and Current Bounds
A stronger, separate question asks whether every such set with contains a point for which the number of distinct distances from to the other points is at least . In notation,
This stronger assertion is false. Erdős Problems #1082
Background
The first question is the exact-constant version of asking how many distances must be determined by a planar set in general position with respect to collinearity. Szemerédi conjectured the bound and proved a weaker bound with replaced by ; his proof was unpublished but was recorded by Erdős. The single-point question is stronger than the total-distance question, since distances from one point are among the distances determined by the whole set. Erdős Problems #1082 Distinct Distances: Open Problems and Current Bounds
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.