The number of distinct distances from a vertex of a convex polygon

DOI10.20382/JOCG.V4I1A1MaRDI QIDQ2968094zbMATH OpenOpenAlexFDO

Authors Gabriel Nivasch, János Pach, Shira Zerbib, Rom Pinchasi

Publication date 9 March 2017

Full work available at URL https://arxiv.org/abs/1207.1266

Mathematics Subject Classification ID

Erd?s problems and related topics of discrete geometry (52C10)

Abstract: ErdH{o}s conjectured in 1946 that every n-point set P in convex position in the plane contains a point that determines at least floor(n/2) distinct distances to the other points of P. The best known lower bound due to Dumitrescu (2006) is 13n/36 - O(1). In the present note, we slightly improve on this result to (13/36 + eps)n - O(1) for eps ~= 1/23000. Our main ingredient is an improved bound on the maximum number of isosceles triangles determined by P.

Recommendations

• On distinct distances from a vertex of a convex polygon
• A lower bound on the number of unit distances between the vertices of a convex polygon
• On distinct distances from a vertex of a convex polygon
• Publication:4504217
• scientific article; zbMATH DE number 865984

Cited in

(7)

• The maximum number of times the same distance can occur among the vertices of a convex \(n\)-gon is \(O(n\log n)\)
• On distinct distances from a vertex of a convex polygon
• The maximum number of unit distances in a convex n-gon
• The distance to a polyhedron
• scientific article; zbMATH DE number 1507557 (Why is no real title available?)
• On distinct distances from a vertex of a convex polygon
• Distinct angle problems and variants

This page was built for publication: The number of distinct distances from a vertex of a convex polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2968094)