Publication

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

János Pach, Gabriel Nivasch
2013
Journal Articles

Abstract

Erd\H{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.

Official source

https://infoscience.epfl.ch/entities/publication/c6be7fec-c7fc-4380-b290-f0067d7bca49

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

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

Chat with Graph Search

Additive and geometric transversality of fractal sets in the integers

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Acceleration of graph pattern mining and applications to financial crime