← All problems

Erdős Problem #97 — Equidistant Points in Convex Polygons

1 year old · traced to

For a finite set A⊂R2A\subset\mathbb{R}^2, say that AA is in convex position if every point of AA is a vertex of its convex hull. For p∈Ap\in A, define the largest number of other points of AA on any circle centered at pp by

MA(p)=max⁡r>0#{q∈A∖{p}:∥q−p∥=r}.M_A(p)=\max_{r>0}\#\{q\in A\setminus\{p\}:\|q-p\|=r\}.

The maximum exists because AA is finite. Is it true that every nonempty finite set AA in convex position has a point p∈Ap\in A such that

MA(p)≤3?M_A(p)\leq 3?

Equivalently, must every convex polygon have a vertex for which no four other vertices are all at the same distance from it? The restriction r>0r>0 excludes the center itself. Erdős Problems #97

Background

Erdős first proposed the analogous assertion with three other vertices instead of four. Danzer disproved that version by constructing a convex 9-gon in which every vertex has three other vertices at a common distance from it; the distance is allowed to depend on the vertex. The episode also prompted a clarification of an incorrectly attributed stronger result: Erdős and Purdy recorded Danzer's correction that his construction established the three-point case, not the claimed result for arbitrary numbers of equidistant vertices. Erdős Problems #97 Erdős and Purdy, Some Extremal Problems in Geometry IV

Erdős restated the four-point conjecture in 1986. The key distinction between the known counterexamples to the three-point version and the question here is the threshold: having three equidistant neighbors at each vertex does not by itself provide four. Erdős, On Some Metric and Combinatorial Geometric Problems (1986)

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.