← All problems

Erdős Problem #982 — Distinct distances from a vertex of a convex polygon

1 year old · traced to

For an integer n≥3n\ge 3, let p0,…,pn−1∈R2p_0,\ldots,p_{n-1}\in\mathbb R^2 be distinct points that are the vertices of a convex nn-gon. For each vertex define its number of distinct distances to the other vertices by

Di=#{∥pi−pj∥:0≤j<n, j≠i}.D_i=\#\{\|p_i-p_j\|:0\le j<n,\ j\ne i\}.

The question is whether, for every such nn-gon, at least one vertex has at least ⌊n/2⌋\lfloor n/2\rfloor distinct distances; equivalently, whether

max⁡0≤i<nDi≥⌊n2⌋\max_{0\le i<n}D_i\ge \left\lfloor\frac n2\right\rfloor

holds for every n≥3n\ge3 and every set of vertices in convex position. Erdős Problems #982 Kominers (2026 preprint)

Background

This is a classical conjecture attributed to Erdős and associated with his work on distance sets; the problem bibliography includes his 1946 paper and the later joint paper with Fishburn, “A postscript on distances in convex nn-gons” (1994). The regular nn-gon shows why the proposed threshold is natural and sharp: each vertex determines exactly ⌊n/2⌋\lfloor n/2\rfloor distances, one for each possible separation around the polygon. Erdős Problems #982 Kominers (2026 preprint) Erdős (1946) Erdős and Fishburn (1994)

A useful route to lower bounds counts good edges: an edge is good when its perpendicular bisector contains at most one point of the configuration. Such an edge can be the base of at most one isosceles triangle with another point as apex. Double-counting these incidences converts a quadratic lower bound on the number of good edges into a linear lower bound for the number of distinct distances from some vertex. In the convex setting, the smallest enclosing circle and its at most three support points divide the polygon into arcs, or caps, where distances from either end vary monotonically; counting pairs within and across these caps is the key geometric input. Kominers (2026 preprint)

Convexity is consequential. The half-bound does not extend to all planar sets with no three collinear: the preprint describes an eight-point configuration, consisting of two concentric squares in a specified relative position, for which every point has exactly three distinct distances, fewer than ⌊8/2⌋=4\lfloor 8/2\rfloor=4. Kominers (2026 preprint)

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.