Wiki
Wiki

Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.

Updated

Problem 652

../

claims/: The 2 claim pages of Problem 652, one per claimant's result; the problem's standing derives from them.


Statement. Let x1,…,xn∈R2x_1,\ldots,x_n\in \mathbb{R}^2 and let $R(x_i)=#{ \lvert x_j-x_i\rvert : j\neq i}$, where the points are ordered such that

R(x1)≤⋯≤R(xn).R(x_1)\leq \cdots \leq R(x_n).

Let αk\alpha_k be minimal such that, for all large enough nn, there exists a set of nn points with R(xk)<αkn1/2R(x_k)<\alpha_kn^{1/2}. Is it true that $\alpha_k\to \infty$ as k→∞k\to \infty?

Formulation. The site's commentary records that Erdős originally conjectured R(x3)/n1/2→∞R(x_3)/n^{1/2}\to\infty as n→∞n\to\infty: that in every set of nn points all but at most two of the points determine many more than n1/2n^{1/2} distinct distances each. That question has the answer no. As the commentary records, Elekes proved that for every kk and all large nn some set of nn points has R(xk)≪kn1/2R(x_k)\ll_k n^{1/2}; his circle-grid construction, which [Ma21] restates in its Section 2, places kk points so that each determines O(kn)O(\sqrt{kn}) distances to the other nn points when 2≤k≤n1/32\le k\le n^{1/3}. So each αk\alpha_k is finite, and the site asks instead whether these constants grow with kk; that question sets the standing.

Status. Proved; the site's label is PROVED. Mathialagan's theorem [Ma21], refereed and credited by the site's curator, answers the question, and Feng and coauthors give a second, unrefereed proof with a weaker growth rate.

Source. erdosproblems.com/652, accessed 2026-09-04. Cite as: T. F. Bloom, Erdős Problem #652, https://www.erdosproblems.com/652.

References.

  • [Ma21] Mathialagan, Surya, On bipartite distinct distances in the plane. Electron. J. Combin. (2021), Paper No. 4.33, 25.

Formalization. None recorded.

Progress

Not yet compiled.

Known Results

Not yet compiled.

Linked library material

These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.