{"id":"openai-math/A-nine-dimensional-counterexample-to-Borsuks-covering-assertion","pdf":"https://github.com/openai/math/blob/main/preprints/A-nine-dimensional-counterexample-to-Borsuks-covering-assertion-September-23-2026/paper.pdf","url":"https://github.com/openai/math/tree/main/preprints/A-nine-dimensional-counterexample-to-Borsuks-covering-assertion-September-23-2026","tags":["discrete-geometry","convex-geometry","borsuk-problem"],"score":0,"title":"A nine-dimensional counterexample to Borsuk's covering assertion","domain":"Combinatorics","family":"156","origin":"ai-generated","source":"openai-math","authors":["OpenAI"],"reviews":0,"subject":"math.CO","summary":"The compact set of rank-one orthogonal projectors on ℝ 4 , with the Frobenius metric, cannot be covered by ten sets of strictly smaller diameter. It therefore gives a counterexample to Borsuk's conjecture in dimension nine.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"discussed":2,"published":"2026-09-23","reactions":{},"discussion":[{"url":"https://gilkalai.wordpress.com/2026/10/07/updates-sharing-ai-progress-on-mathematics-amazing-and-my-lecture-plans/#:~:text=a%20compact%20set%20in%20nine-dimensional%20Euclidean%20space%20that%20cannot%20be%20covered%20by%20ten%20sets%20of%20smaller%20diameter","date":"2026-10-07","kind":"web","site":"Combinatorics and more","text":"a compact set in nine-dimensional Euclidean space that cannot be covered by ten sets of smaller diameter. Hadwiger’s conjecture. In Combinatorics News I discussed Hadwiger’s conjecture, which relates graph coloring to complete minors, while reporting the disproof of its odd-minor strengthening.…","added":"2026-10-24","title":"Updates: Sharing AI progress on mathematics (amazing!); and my lecture plans","author":"Gil Kalai"},{"url":"https://gilkalai.wordpress.com/2026/10/21/progress-on-borsuks-problem-and-answer-to-tyi-60/#:~:text=One%20of%20the%20700%20or%20so%20papers%20released%20by%20Open%20AI%20on%20October%206%2C%202026%20asserts%20that%20f%289%29%3E10","date":"2026-10-21","kind":"web","site":"Combinatorics and more","text":"One of the 700 or so papers released by Open AI on October 6, 2026 asserts that f(9)>10 . This is a major progress on the Borsuk’s problem. (Of course, the proof needs to be carefully checked. The main theorem has also been formalized in Lean.) The construction itself is one of the constructions…","added":"2026-11-03","title":"Progress on Borsuk’s Problem and Answer to TYI 60.","author":"Gil Kalai"}],"formalized":true,"family_title":"Borsuk's conjecture fails in dimension nine"}