Borsuk's conjecture on partitioning sets of bounded diameter
Let be a set of diameter in Euclidean -space . Borsuk's conjecture. Every such set is the union of sets, each of diameter less than . The conjecture is the classical Borsuk problem on reducing the diameter of a set by partitioning it; its resolution depends on the dimension, and the general statement is not valid in all dimensions.
References
Status
- Refuted: Jeff Kahn and Gil Kalai. A counterexample to Borsuk's conjecture (Bulletin of the American Mathematical Society (N.S.), 1993) https://www.ams.org/journals/bull/1993-29-01/S0273-0979-1993-00398-7/
Source: M. Hujter and Z. Lángi, “On the multiple Borsuk numbers of sets”, arXiv:1206.0892 (2012).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 1
Claimed by OpenAI. The manuscript claims that the rank-one orthogonal projectors on R^4, viewed in the nine-dimensional affine space of trace-one symmetric matrices with its Euclidean Frobenius metric, cannot be covered by ten sets of smaller diameter. This gives a claimed nine-dimensional counterexample to the page’s Borsuk partition bound. The page already notes that the unrestricted conjecture is false in some dimensions; no priority claim is made.See full solution
GitHub repository: https://github.com/openai/math
- OpenAI-156-01-A-nine-dimensional-counterexample-to-Borsuk-s-covering-assertion.pdfOpen