Some old and new problems in combinatorial geometry I: Around Borsuk's problem
classification
🧮 math.CO
cs.CGmath.MG
keywords
borsukdiameterproblemaroundaskedcombinatorialcoveredevery
read the original abstract
Borsuk asked in 1933 if every set of diameter 1 in $R^d$ can be covered by $d+1$ sets of smaller diameter. In 1993, a negative solution, based on a theorem by Frankl and Wilson, was given by Kahn and Kalai. In this paper I will present questions related to Borsuk's problem.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
The Grasshopper Problem on the Sphere
The paper provides the detailed geometric and computational methods for solving the spherical grasshopper problem in the context of Bell inequalities and singlet simulation.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.