학술

A refinement of Szemer\'edi's distinct-distance bound for points in general position

arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.

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é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.

관련 뉴스