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 points in the Euclidean plane determines at least distinct distances. This refines the classical bound 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.