← All problems

Erdős Problem #660 — Distinct distances in convex polyhedra

51 years old · traced to

Let PP be a convex polyhedron in R3\mathbb{R}^3 with nn vertices x1,…,xnx_1,\ldots,x_n, and let D(P)D(P) be the number of distinct Euclidean distances determined by its vertices:

D(P)=∣{∥xi−xj∥:1≤i<j≤n}∣.D(P)=\bigl|\{\lVert x_i-x_j\rVert:1\le i<j\le n\}\bigr|.

Is the following uniform asymptotic lower bound true: for every ε>0\varepsilon>0, does there exist NN such that, for every n≥Nn\ge N and every such PP with nn vertices,

D(P)≥(12−ε)n?D(P)\ge \left(\frac12-\varepsilon\right)n?

Erdős Problem #660

Background

This is a convex-geometric version of the distinct-distance problem, which asks how many different pairwise Euclidean distances a finite point set must determine. Erdős’s 1975 discussion places the three-dimensional question alongside the planar convex-polygon problem: Altman proved that the vertices of a convex polygon determine at least ⌊n/2⌋\lfloor n/2\rfloor distinct distances. The proposed three-dimensional coefficient 1/21/2 is thus motivated by the planar lower bound, but the planar result does not itself give that bound for polyhedra. 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.