The two-distance sets in dimension four

2018/06/20 by Szöllősi, Ferenc
#Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.1806.07861

Abstract

A finite set of distinct vectors X in the d-dimensional Euclidean space ℝ^d is called a 2-distance set, if the set of mutual distances between distinct elements of X has cardinality exactly 2. In this note we classify the 2-distance sets in ℝ⁴ up to isometry with computer-aided methods.

Related

• Constructions of maximum few-distance sets in Euclidean spaces
• A 2-distance set with 277 points in the Euclidean space of dimension 23
• Regular two distance sets
• The Erdős-Falconer distance problem between arbitrary sets and k-coordinatable sets in finite fields
• On the distance sets spanned by sets of dimension d/2 in ℝ^d