A Proof of a Dodecahedron Conjecture for Distance Sets
GRAPHS AND COMBINATORICS(2021)
摘要
finite subset of a Euclidean space is called an s -distance set if there exist exactly s values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all 5-distance sets in ℝ^3 is 20, and every 5-distance set in ℝ^3 with 20 points is similar to the vertex set of a regular dodecahedron.
更多查看译文
关键词
Distance sets,Dodecahedron
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要