Counting large distances in convex polygons

Mathematics – Combinatorics

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Shorter version presented at EuroComb 2011

Scientific paper

In a convex n-gon, let d[1] > d[2] > ... denote the set of all distances between pairs of vertices, and let m[i] be the number of pairs of vertices at distance d[i] from one another. Erdos, Lovasz, and Vesztergombi conjectured that m[1] + ... + m[k] <= k*n. Using a new computational approach, we prove their conjecture when k <= 4 and n is large; we also make some progress for arbitrary k by proving that m[1] + ... + m[k] <= (2k-1)n. Our main approach revolves around a few known facts about distances, together with a computer program that searches all distance configurations of two disjoint convex hull intervals up to some finite size. We thereby obtain other new bounds such as m[3] <= 3n/2 for large n.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Counting large distances in convex polygons does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Counting large distances in convex polygons, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Counting large distances in convex polygons will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-474097

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.