Erdős Problem #1087 — Degenerate four-point subsets with repeated distances
For an integer , let be a set of distinct points. For each four-point subset , call degenerate if two distinct unordered pairs of its points have equal Euclidean distance; equivalently, the six pairwise distances among the four points are not all distinct. Define to be the largest possible number of degenerate four-point subsets as ranges over all such sets. Estimate ; in particular, is it true that for every , one has for all sufficiently large (equivalently, the proposed upper bound )? Erdős and Purdy (1971) Erdős (1975)
Background
Erdős and Purdy posed this as a related extremal question in their 1971 study of geometric configurations, after considering problems involving distances and other metric constraints. Their formulation makes degeneracy a condition on the six distances within a four-point subset: at least two must coincide. In 1975, Erdős returned to the question and recorded the conjecture that the count is below for every fixed . Erdős and Purdy (1971) Erdős (1975)
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 0
No solutions have been posted yet.