Constructions of maximum few-distance sets in euclidean spaces
Research output: Contribution to journal › Article › Scientific › peer-review
A finite set of vectors X in the d-dimensional Euclidean space Rd is called an s-distance set if the set of mutual distances between distinct elements of X has cardinality exactly s. In this paper we present a combined approach of isomorph-free exhaustive generation of graphs and Gröbner basis computation to classify the largest 3-distance sets in R4, the largest 4-distance sets in R3, and the largest 6-distance sets in R2. We also construct new examples of large s-distance sets in Rd for d ≤ 8 and s ≤ 6, and independently verify several earlier results from the literature.
|Journal||Electronic Journal of Combinatorics|
|Publication status||Published - 1 Jan 2020|
|MoE publication type||A1 Journal article-refereed|