The two-distance sets in dimension four

DOI10.1007/978-3-030-90048-9_2OpenAlexW3213481341MaRDI QIDQ2695467

Ferenc Szöllősi

Publication date: 31 March 2023

Full work available at URL: https://arxiv.org/abs/1806.07861

Mathematics Subject Classification ID

Applications of game theory (91A80) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Uses Software

• CoCoALib

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Classification of seven-point four-distance sets in the plane
• Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\)
• Towards a proof of the 24-cell conjecture
• Minimal Euclidean representations of graphs
• Spherical two-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Maximum planar sets that determine \(k\) distances
• Lattice-point examples for a question of Erdős
• New maximal two-distance sets
• A geometrical characterization of strongly regular graphs
• Classification of three-distance sets in two dimensional Euclidean space
• Constructions of maximum few-distance sets in Euclidean spaces
• Graphs and spherical two-distance sets
• On Two-Distance Sets in Euclidean Space
• The Closest Packing of Spherical Caps in n Dimensions