Constructions of maximum few-distance sets in Euclidean spaces (Q2290349)

This paper focuses on the problem of determining, given the natural numbers \(d\) and \(s\), the largest finite subsets of vectors in \(\mathbb{R}^d\) for which the set of mutual distances between distinct vectors has cardinality \(s\). More precisely, the authors focus primarly on the case \(d=4\) and \(s=3\), but also on the cases \(d=3\) and \(s=4\), \(d=3\) and \(s=3\), and \(d=2\) and \(s=6\), respectively. The given proofs are based on classical graph generation techniques and on elements of computational commutative algebra. Other related examples are also discussed.