← All problems

Erdős Problem #1087 — Degenerate four-point subsets with repeated distances

For an integer n≥4n\ge 4, let P⊂R2P\subset\mathbb{R}^2 be a set of nn distinct points. For each four-point subset Q∈(P4)Q\in\binom{P}{4}, call QQ 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 f(n)f(n) to be the largest possible number of degenerate four-point subsets as PP ranges over all such sets. Estimate f(n)f(n); in particular, is it true that for every ε>0\varepsilon>0, one has f(n)≤n3+εf(n)\le n^{3+\varepsilon} for all sufficiently large nn (equivalently, the proposed upper bound f(n)≤n3+o(1)f(n)\le n^{3+o(1)})? 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 n3+εn^{3+\varepsilon} for every fixed ε>0\varepsilon>0. Erdős and Purdy (1971) Erdős (1975)

References

Progress summary

Never refreshed

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.