Pavle Blagojevic, Benjamin Matschke, and Guenter Ziegler settled for the case that is a prime, the “colorful Tverberg’s conjecture.” (Problem 6 in this post.) This gives a sharp version for Zivaljevic and Vrecica theorem, and crossed the “connectivity of chessboard complexes barrier”. Here is the link to the breakthrough paper.
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
- Amazing: Hao Huang Proved the Sensitivity Conjecture!
- Amazing: Justin Gilmer gave a constant lower bound for the union-closed sets conjecture
- TYI 30: Expected number of Dice throws
- Elchanan Mossel's Amazing Dice Paradox (your answers to TYI 30)
- Quantum Computers: A Brief Assessment of Progress in the Past Decade
- Extremal Combinatorics III: Some Basic Theorems
- R(5,5) ≤ 48
- The Quantum Debate is Over! (and other Updates)
RSS
I think this is the new version:
http://front.math.ucdavis.edu/0911.2692
I think this is already a follow-up paper with further results
Pingback: Seven Problems Around Tverberg’s Theorem | Combinatorics and more
Pingback: Seven Problems Around Tverberg’s Theorem | Combinatorics and more