Classification of seven-point four-distance sets in the plane (Q351648): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(4 intermediate revisions by 4 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Charalampos Charitos / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 51M05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 52C10 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6185227 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
\(n\)-point \(k\)-distance set | |||
Property / zbMATH Keywords: \(n\)-point \(k\)-distance set / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
isomorphism | |||
Property / zbMATH Keywords: isomorphism / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
diameter graph | |||
Property / zbMATH Keywords: diameter graph / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
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 | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1134/s000143461303019x / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2031186817 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:07, 30 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