Erdős Problem #957 — Product of the extreme-distance multiplicities
Let and let consist of distinct points. For each unordered pair of distinct points, take its Euclidean distance, and let and be the numbers of pairs attaining, respectively, the least and greatest of these distances. The question is whether the following bound holds uniformly over all such sets as :
Here uniformity means that the error tending to zero can be chosen as a function of alone, independently of . Erdős Problem #957 Dumitrescu (2019)
Background
Erdős and Pach raised the product inequality in their 1990 paper on repeated distances. They noted that a construction of Makai makes the leading constant best possible, and also discussed an additive bound for the two extreme-distance multiplicities, asking for the best possible coefficient in its square-root term. Thus the product question sits alongside a finer problem about the sum of the two multiplicities. Erdős Problem #957 Erdős and Pach (1990)
References
A. Dumitrescu, A product inequality for extreme distances, Computational Geometry 85 (2019), 101577.
Source: A. Dumitrescu, A product inequality for extreme distances, Computational Geometry 85 (2019), 101577.
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.