On Borsuk's conjecture for two-distance sets
classification
🧮 math.MG
keywords
borsuktwo-distanceconjecturesetsdimensionanswercannotconsisting
read the original abstract
In this paper we answer Larman's question on Borsuk's conjecture for two-distance sets. We find a two-distance set consisting of 416 points on the unit sphere in the dimension 65 which cannot be partitioned into 83 parts of smaller diameter. This also reduces the smallest dimension in which Borsuk's conjecture is known to be false. Other examples of two-distance sets with large Borsuk's numbers will be given.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Gromov--Hausdorff Distance between Simplexes and Two-Distance Spaces
Exact Gromov-Hausdorff distances are derived between arbitrary simplexes and 2-distance spaces, yielding a complete solution to the generalized Borsuk problem and expressions for graph clique cover and chromatic numbers.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.