Convex nonagons with five intervertex distances (Q1912369): Difference between revisions

The authors prove that the vertices of a convex 9-gon in the euclidean plane determine exactly five distinct distances if and only if they are a subset of the vertices of a regular 10-gon or a regular 11-gon, and conjecture that the vertices of a convex \(2m + 1\)-gon determine exactly \(m + 1\) distance \((m \geq 3)\) if and only if they are a subset of the vertices of a regular \(2m + 2\)- or \(2m + 3\)-gon. This may be seen as one step below the extremal situation of Altman's theorem which states that the vertices of a convex \(n\)-gon determine at least \(\lfloor {1 \over n} n \rfloor\) distinct distances, with equality if and only if the \(n\)-gon is regular, or \(n\) is even and it is a regular \(n + 1\)-gon minus one point. The main reason for the study of point sets with few distinct distances is the famous Erdős conjecture on the minimal number of distinct distances determined by \(n\) points in the plane, which is believed to be \(\Theta ({n \over \sqrt {\log n}})\) as can be reached by sections of the triangular lattice.