arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1810.10089math.MG
收藏

Lebesgue覆盖问题的一个上界

An Upper Bound for Lebesgue's Covering Problem

Philip Gibbs

摘要:

1914年,Henri Lebesgue提出了一个覆盖问题,试图找到最小区域的凸形,该区域包含与欧几里得平面上任何单位直径点集全等的子集。可以改进和扩展之前用于构建此类覆盖的方法,以提供最佳区域的改进的上界。发现其上界为0.8440935944。

英文摘要:

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a covering can be refined and extended to provide an improved upper bound for the optimal area. An upper bound of 0.8440935944 is found.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑