Distances in Convex Polygons

Peter Fishburn
Additional contact information
Peter Fishburn: Lucent Technologies Bell Laboratories

A chapter in The Mathematics of Paul Erdős I, 2013, pp 483-492 from Springer

Abstract: 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.

Keywords: Convex Polygon; Intervertex Distances; Conjecture; Convex Heptagon; Convex Octagon (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4614-7258-2_30

Ordering information: This item can be ordered from
http://www.springer.com/9781461472582

DOI: 10.1007/978-1-4614-7258-2_30

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().