Classification of seven-point four-distance sets in the plane (Q351648): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Maximum planar sets that determine \(k\) distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Classification of three-distance sets in two dimensional Euclidean space / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Uniqueness of maximum planar five-distance sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex nonagons with five intervertex distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convex polygons with few intervertex distances / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4650008 / rank | |||
Normal rank |
Revision as of 15:33, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Classification of seven-point four-distance sets in the plane |
scientific article |
Statements
Classification of seven-point four-distance sets in the plane (English)
0 references
8 July 2013
0 references
A point set \(X\) in the Euclidean plane is called a \(k\)-distance set if there are exactly \(k\) different distances between two distinct points in \(X.\) Two planar sets are called isomorphic if there exists a similar transformation from one to the other. The main result of the paper states that there are only \(42\) seven-point four distance sets in the plane up to isomorphism. All these sets are shown in a figure.
0 references
\(n\)-point \(k\)-distance set
0 references
isomorphism
0 references
diameter graph
0 references