Classification of three-distance sets in two dimensional Euclidean space (Q1883614)

The author solves the problem of determining three-distance sets in the Euclidean plane. A set of points in the Euclidean plane is said to be an \(s\)-distance set if there are exactly \(s\) different distances between two distinct points in it. An \(s\)-distance set is called maximal if it cannot be contained in a larger \(s\)-distance set. Three-distance sets in the plane were previously studied by \textit{S. J. Einhorn} and \textit{I. J. Schoenberg} [Nederl. Akad. Wet., Proc., Ser. A 69, 489--504 (1966; Zbl 0145.17103)], where a conjecture regarding them was made. It proved to be wrong, as shown by the following results obtained in this paper (all sets are in the Euclidean plane): (1) There are 34 three-distance sets having 5 points; (2) There is no three-distance set having more than 7 points; (3) There exist only 2 maximal three-distance sets having 7 points; (4) There exist only 6 maximal three-distance sets having 6 points; (5) There exist only 16 maximal three-distance sets having 5 points.