Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space
A subset \(X\) of the \(k\)-dimensional Euclidean space \(\mathbb{R}^k\) that contains \(n\) points is called an isosceles \(n\)-point \(s\)-distance set if there are exactly \(s\) distances between two distinct points in \(X\) and if every triplet of points selected from them forms an isosceles triangle. Evidently there are a lot of questions for existence of these special point-structures depending on \(k\), \(n\) and \(s\). Beforehand the author gives a short summary about known facts. The main result of this paper is the classification of all isosceles 7-point 3-distance sets in \(\mathbb{R}^3\): There exist exactly fifteen isomorphic-classes. Besides a multitude of properties of distance sets are discussed.
- 9-Point and 7-Point Configurations in 3-Space
- An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
- Classification of isosceles eight-point sets in three-dimensional Euclidean space
- Classification of three-distance sets in two dimensional Euclidean space
- scientific article; zbMATH DE number 4191741 (Why is no real title available?)
- scientific article; zbMATH DE number 3815662 (Why is no real title available?)
- scientific article; zbMATH DE number 3234139 (Why is no real title available?)
- New maximal two-distance sets
- On Two-Distance Sets in Euclidean Space
This page was built for publication: Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q872023)