文章基本信息

标题：A Product Inequality for Extreme Distances
本地全文：下载
作者：Adrian Dumitrescu
期刊名称：LIPIcs : Leibniz International Proceedings in Informatics
电子版ISSN：1868-8969
出版年度：2019
卷号：129
页码：1-12
DOI：10.4230/LIPIcs.SoCG.2019.30
出版社：Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
摘要：Let p_1,...,p_n be n distinct points in the plane, and assume that the minimum inter-point distance occurs s_{min} times, while the maximum inter-point distance occurs s_{max} times. It is shown that s_{min} s_{max} <= (9/8)n^2 + O(n); this settles a conjecture of Erdös and Pach (1990).
关键词：Extreme distances; repeated distances