极值距离的乘积不等式

Discret. Comput. Geom. Pub Date : 2019-12-01 DOI:10.4230/LIPIcs.SoCG.2019.30

A. Dumitrescu

{"title":"极值距离的乘积不等式","authors":"A. Dumitrescu","doi":"10.4230/LIPIcs.SoCG.2019.30","DOIUrl":null,"url":null,"abstract":"Abstract 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).","PeriodicalId":11245,"journal":{"name":"Discret. Comput. Geom.","volume":"34 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Product Inequality for Extreme Distances\",\"authors\":\"A. Dumitrescu\",\"doi\":\"10.4230/LIPIcs.SoCG.2019.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Abstract 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).\",\"PeriodicalId\":11245,\"journal\":{\"name\":\"Discret. Comput. Geom.\",\"volume\":\"34 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Discret. Comput. Geom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4230/LIPIcs.SoCG.2019.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discret. Comput. Geom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4230/LIPIcs.SoCG.2019.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

允许p 1、p、p在飞机上留下模糊的点，让我认为最小的中间点停留在最小的时间，而最大的中间点停留在最大的时间。是麦克斯展示那个s min s≤9 8 + 2 n O (n);这settles a conjecture的Erdős和Pach(1990年)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

A Product Inequality for Extreme Distances

Abstract 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).

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discret. Comput. Geom.

自引率

0.00%

发文量

期刊最新文献

On Reverse Shortest Paths in Geometric Proximity Graphs Algorithms for Radius-Optimally Augmenting Trees in a Metric Space Augmenting Graphs to Minimize the Radius Linear-Time Approximation Scheme for k-Means Clustering of Axis-Parallel Affine Subspaces Intersecting Disks Using Two Congruent Disks