Erdős Problem #659 — Point Sets with Few Distances
Does there exist a sequence of finite sets such that , every subset of four points of determines at least three distinct distances, and the number of distinct distances determined by satisfies
Progress summary
A public preprint gives an explicit stretched-grid construction that satisfies both requirements, so the problem is now solved.
Erdős posed the problem in 1997. It asks for planar sets with unusually few distances while retaining a strong local four-point condition.
Known results
- Moree and Osburn established the distance bound for the stretched lattice.
- Lund and Sheffer independently found the construction and excluded equilateral triangles and squares.
- Perucca classified the six four-point configurations determining only two distances.
January 2026 affirmative solution
A preprint constructs , proves the four-point condition using Perucca’s classification, and obtains the distance bound from Bernays’ theorem for . A second preprint gives an independent lattice construction and corroborates the affirmative answer.
Current status (as of April 2026): The problem is resolved by explicit preprint constructions; the four-point condition and distance bound are established.
Solutions 0
No solutions have been posted yet.