## Optimal Colorful Tverberg’s Theorem by Blagojecic, Matschke, and Ziegler

Pavle Blagojevic, Benjamin Matschke, and Guenter Ziegler settled  for the case that $r+1$ 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.

Advertisements
This entry was posted in Convexity. Bookmark the permalink.

### 4 Responses to Optimal Colorful Tverberg’s Theorem by Blagojecic, Matschke, and Ziegler

1. domotorp says:

I think this is the new version:
http://front.math.ucdavis.edu/0911.2692

2. Gil says:

I think this is already a follow-up paper with further results