Maximizing the Sum of the Distances between Four Points on the Unit Hemisphere

Zhenbing Zeng, Jian Lu, Yaochen Xu, Yuzheng Wang
{"title":"Maximizing the Sum of the Distances between Four Points on the Unit Hemisphere","authors":"Zhenbing Zeng, Jian Lu, Yaochen Xu, Yuzheng Wang","doi":"10.4204/EPTCS.352.4","DOIUrl":null,"url":null,"abstract":"In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular neighborhood of the local maximum point in the feasible set, which size is explicitly determined, and proved that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the rest part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube the conjecture can be verified by estimating the objective function with exact numerical computation.","PeriodicalId":127390,"journal":{"name":"Automated Deduction in Geometry","volume":"36 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Automated Deduction in Geometry","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.352.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we prove a geometrical inequality which states that for any four points on a hemisphere with the unit radius, the largest sum of distances between the points is 4+4*sqrt(2). In our method, we have constructed a rectangular neighborhood of the local maximum point in the feasible set, which size is explicitly determined, and proved that (1): the objective function is bounded by a quadratic polynomial which takes the local maximum point as the unique critical point in the neighborhood, and (2): the rest part of the feasible set can be partitioned into a finite union of a large number of very small cubes so that on each small cube the conjecture can be verified by estimating the objective function with exact numerical computation.
最大化单位半球上四个点之间距离的总和
本文证明了一个几何不等式,该不等式证明了在具有单位半径的半球上任意四个点,点间距离的最大和为4+4*sqrt(2)。在我们的方法中,我们构造了可行集中局部最大值点的矩形邻域,其大小是明确确定的,并证明了(1):目标函数被一个以局部最大值点为邻域内唯一临界点的二次多项式有界;(2):可行集的其余部分可划分为许多极小的立方体的有限并,以便在每个小立方体上通过精确的数值计算估计目标函数来验证猜想。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信