arXiv:2611.25148v1 Announce Type: new Abstract: We prove that every collinear triple free set of $n\ge4$ points in the Euclidean plane determines at least $\lfloor n/3\rfloor+1$ distinct distances. This refines the classical bound $\lceil(n-1)/3\rceil$ of Szemer\'edi 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.
Continue to arXiv Mathematics →You are being forwarded in 6s — stay on this page