Classification of three-distance sets in two dimensional Euclidean space

DOI10.1016/j.ejc.2003.12.009zbMath1059.51017OpenAlexW2059472015MaRDI QIDQ1883614

Masashi Shinohara

Publication date: 13 October 2004

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2003.12.009

zbMATH Keywords

three-distance set

Mathematics Subject Classification ID

Other designs, configurations (05B30) Elementary problems in Euclidean geometries (51M04)

Related Items (15)

Classification of isosceles eight-point sets in three-dimensional Euclidean space ⋮ Classification of seven-point four-distance sets in the plane ⋮ Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space ⋮ Maximal 2-distance sets containing the regular simplex ⋮ The two-distance sets in dimension four ⋮ Bounds on three- and higher-distance sets ⋮ Uniqueness of maximum planar five-distance sets ⋮ Complementary Ramsey Numbers ⋮ Complex spherical codes with two inner products ⋮ A geometrical characterization of strongly regular graphs ⋮ On isosceles sets in the 4-dimensional Euclidean space ⋮ Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) ⋮ On a generalization of distance sets ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ A proof of a dodecahedron conjecture for distance sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• New maximal two-distance sets
• 9-Point and 7-Point Configurations in 3-Space
• On Two-Distance Sets in Euclidean Space

This page was built for publication: Classification of three-distance sets in two dimensional Euclidean space