A proof of a dodecahedron conjecture for distance sets

DOI10.1007/S00373-021-02318-5MaRDI QIDQ2051877zbMATH OpenOpenAlexWikidataFDO

Authors Hiroshi Nozaki, Masashi Shinohara

Publication date 25 November 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

distance setsdodecahedron

Mathematics Subject Classification ID

General theory of distance geometry (51K05) Erd?s problems and related topics of discrete geometry (52C10)

Abstract: A finite subset of a Euclidean space is called an $s$-distance set if there exist exactly $s$ values of the Euclidean distances between two distinct points in the set. In this paper, we prove that the maximum cardinality among all 5-distance sets in $mathbb{R}^3$ is 20, and every $5$-distance set in $mathbb{R}^3$ with $20$ points is similar to the vertex set of a regular dodecahedron.

Review text

An \(n\)-point \(s\)-distance set is a set of \(n\) points in a Euclidean space such that the distances between distinct points of the set take precisely \(s\) values. For the particular case of the Euclidean \(3\)-space, the authors show that precisely the vertex sets of regular dodecahedrons are the \(20\)-point \(5\)-distance sets, and that \(20\) is the upper limit for the cardinality of a \(5\)-set.

Recommendations

• Classification of three-distance sets in two dimensional Euclidean space
• Two and a half billion years of distance research
• Bounds on three- and higher-distance sets
• Uniqueness of maximum planar five-distance sets
• Constructions of maximum few-distance sets in Euclidean spaces

Cites work

• A proof of Erdős-Fishburn's conjecture for \(g(6)=13\)
• A simpler proof for the two disjoint odd cycles theorem
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Classification of three-distance sets in two dimensional Euclidean space
• Complementary Ramsey numbers and Ramsey graphs
• Constructions of maximum few-distance sets in Euclidean spaces
• Distance-regular graphs
• Group theory in physics. A practitioner's guide
• How many P-polynomial structures can an association scheme have?
• scientific article; zbMATH DE number 3874093 (Why is no real title available?)
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 3234139 (Why is no real title available?)
• Maximum planar sets that determine k distances
• New maximal two-distance sets
• On Two-Distance Sets in Euclidean Space
• Some properties of graphs of diameters
• The Magma algebra system. I: The user language
• The width of quadrangulations of the projective plane
• Uniqueness of maximum planar five-distance sets
• Unsolved problems in geometry

Cited in

(7)

• Classification of three-distance sets in two dimensional Euclidean space
• scientific article; zbMATH DE number 850784 (Why is no real title available?)
• Maximum independent sets of the 120-cell and other regular polyhedra
• On the size of maximal binary codes with 2, 3, and 4 distances
• Euclidean sets with only one distance modulo a prime ideal
• Classification of isosceles eight-point sets in three-dimensional Euclidean space
• The 22 minimal dichotomy decompositions of the \(K_5\)-distance

Describes a project that uses

Uses Software

• Magma
• Maple

This page was built for publication: A proof of a dodecahedron conjecture for distance sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051877)