Recent Comments
-
Recent Posts
- My Notices AMS Paper on Quantum Computers – Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Updates from Cambridge
- Random Circuit Sampling: Fourier Expansion and Statistics
- Plans and Updates: Complementary Pictures
- Updates and Plans IV
- Three Remarkable Quantum Events at the Simons Institute for the Theory of Computing in Berkeley
- Yair Shenfeld and Ramon van Handel Settled (for polytopes) the Equality Cases For The Alexandrov-Fenchel Inequalities
- On the Limit of the Linear Programming Bound for Codes and Packing
Top Posts & Pages
- My Notices AMS Paper on Quantum Computers - Eight Years Later, a Lecture by Dorit Aharonov, and a Toast to Michael Ben-Or
- Arturo Merino, Torsten Mütze, and Namrata Apply Gliders for Hamiltonicty!
- Navier-Stokes Fluid Computers
- Updates and plans III.
- TYI 30: Expected number of Dice throws
- Answer: Lord Kelvin, The Age of the Earth, and the Age of the Sun
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- An interview with Noga Alon
- To cheer you up in difficult times 23: the original hand-written slides of Terry Tao's 2015 Einstein Lecture in Jerusalem
RSS
Tag Archives: Borsuk’s conjecture
Progress Around Borsuk’s Problem
I was excited to see the following 5-page paper: Convex bodies of constant width with exponential illumination number by Andrii Arman, Andrii Bondarenko, and Andriy Prymak Abstract: We show that there exist convex bodies of constant width in with illumination … Continue reading
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 two-distance 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 Important remark (November 2023): as Eric Naslund pointed out (in his 2017 comment) the constants (1.203 and 1.225) that were presented here since 2009 refer to the consequence for Borsuk’s problem and not to the Witsenhausen’s Problem, where … 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 Frankl-Wilson theorem. Let be the set of vectors of length . … Continue reading