Advertisement
Published in:
2013 | OriginalPaper | Chapter
Distances in Convex Polygons
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
Summary.
One of Paul Erdős’s many continuing interests is distances between points in finite sets. We focus here on conjectures and results on intervertex distances in convex polygons in the Euclidean plane. Two conjectures are highlighted. Let t(x) be the number of different distances from vertex x to the other vertices of a convex polygon C, let \(T(C) = \Sigma t(x)\), and take \(T_{n} =\min \{ T(C) : C\mbox{ has $n$ vertices}\}\). The first conjecture is \(T_{n} = \left ({ n \atop 2} \right )\). The second says that if \(T(C) = \left ({ n \atop 2} \right )\) for a convex n-gon, then the n-gon is regular if n is odd, and is what we refer to as bi-regular if n is even. The conjectures are confirmed for small n.