Erdős Problem #660 — Distinct distances in convex polyhedra
Let be a convex polyhedron in with vertices , and let be the number of distinct Euclidean distances determined by its vertices:
Is the following uniform asymptotic lower bound true: for every , does there exist such that, for every and every such with vertices,
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 distinct distances. The proposed three-dimensional coefficient is thus motivated by the planar lower bound, but the planar result does not itself give that bound for polyhedra. 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.