betaFeedback

WorksMathematics

A refinement of Szemerédi's distinct-distance bound for points in general position

Abstract

We prove that every collinear triple free set of n≥4n\ge4 points in the Euclidean plane determines at least ⌊n/3⌋+1\lfloor n/3\rfloor+1 distinct distances. This refines the classical bound ⌈(n−1)/3⌉\lceil(n-1)/3\rceil of Szemerédi that is based on counting isosceles triangles. The refinement is based on treating the diameters separately: they only appear on the convex hull, so for them, we can use the planar diameter theorem and Altman's theorem on distances in convex polygons.

Paper details

vlnc:W_6rn3jz5r
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 8

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

ChatGPT

View statement
Looking for related papers…