Uniqueness of maximum three-distance sets in the three-dimensional Euclidean space

Abstract

A subset $X$ in the $d$-dimensional Euclidean space is called a $k$-distance set if there are exactly $k$ distances between two distinct points in $X$. Einhorn and Schoenberg conjectured that the vertices of the regular icosahedron is the only 12-point three-distance set in ${\mathbb{R}}^3$ up to isomorphism. In this paper, we prove the uniqueness of 12-point three-distance sets in ${\mathbb{R}}^3$.

10 pages, 4 figures

Cited by in corpus (7)

• Maximal $m$-distance sets containing the representation of the Johnson graph $J(n,m)$
• Complementary Ramsey numbers and Ramsey graphs
• Semidefinite Programming Bounds For Spherical Three-distance Sets
• Complex spherical codes with three inner products
• Maximal $m$-distance sets containing the representation of the Hamming graph $H(n,m)$
• Maximal $2$-distance sets containing the regular simplex
• A proof of a Dodecahedron conjecture for distance sets