Recent Comments

Recent Posts
 The Trifference Problem
 Greatest Hits 20152022, Part II
 Greatest Hits 20152022, Part I
 Tel Aviv University Theory Fest is Starting Tomorrow
 Alef’s Corner
 A Nice Example Related to the Frankl Conjecture
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Barnabás Janzer: Rotation inside convex Kakeya sets
 Inaugural address at the Hungarian Academy of Science: The Quantum Computer – A Miracle or Mirage
Top Posts & Pages
 Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
 Amazing: Justin Gilmer gave a constant lower bound for the unionclosed sets conjecture
 Amazing: Jinyoung Park and Huy Tuan Pham settled the expectation threshold conjecture!
 Quantum Computers: A Brief Assessment of Progress in the Past Decade
 A Nice Example Related to the Frankl Conjecture
 Amazing: Karim Adiprasito proved the gconjecture for spheres!
 The Trifference Problem
 Aubrey de Grey: The chromatic number of the plane is at least 5
 Sarkaria's Proof of Tverberg's Theorem 1
RSS
Tag Archives: Borsuk’s conjecture
Around Borsuk’s Conjecture 3: How to Save Borsuk’s conjecture
Borsuk asked in 1933 if every bounded set K of diameter 1 in can be covered by d+1 sets of smaller diameter. A positive answer was referred to as the “Borsuk Conjecture,” and it was disproved by Jeff Kahn and me in 1993. … Continue reading
Andriy Bondarenko Showed that Borsuk’s Conjecture is False for Dimensions Greater Than 65!
The news in brief Andriy V. Bondarenko proved in his remarkable paper The Borsuk Conjecture for twodistance sets that the Borsuk’s conjecture is false for all dimensions greater than 65. This is a substantial improvement of the earlier record (all dimensions … Continue reading
A Weak Form of Borsuk Conjecture
Problem: Let P be a polytope in with n facets. Is it always true that P can be covered by n sets of smaller diameter? I also asked this question over mathoverflow, with some background and motivation.
Around Borsuk’s Conjecture 1: Some Problems
Greetings to all! Karol Borsuk conjectured in 1933 that every bounded set in can be covered by sets of smaller diameter. In a previous post I described the counterexample found by Jeff Kahn and me. I will devote a few posts … Continue reading
The Combinatorics of Cocycles and Borsuk’s Problem.
Cocycles Definition: A cocycle is a collection of subsets such that every set contains an even number of sets in the collection. Alternative definition: Start with a collection of sets and consider all sets that contain an odd number of members … Continue reading
Raigorodskii’s Theorem: Follow Up on Subsets of the Sphere without a Pair of Orthogonal Vectors
Andrei Raigorodskii (This post follows an email by Aicke Hinrichs.) In a previous post we discussed the following problem: Problem: Let be a measurable subset of the dimensional sphere . Suppose that does not contain two orthogonal vectors. How large … Continue reading
Borsuk’s Conjecture
Karol Borsuk conjectured in 1933 that every bounded set in can be covered by sets of smaller diameter. Jeff Kahn and I found a counterexample in 1993. It is based on the FranklWilson theorem. Let be the set of vectors of length . … Continue reading