Bárány–Larman colored Tverberg conjecture

From papers

Let F1,,Fd+1F_1,\ldots,F_{d+1} be families of rr points each in \mathdsRd\mathds{R}^d, considered as color classes. A colorful partition is a partition into rr sets A1,,ArA_1,\ldots,A_r such that each part has exactly one point of each color. Bárány–Larman's colored Tverberg conjecture. There is a colorful partition such that

j=1rconv(Aj).\bigcap_{j=1}^r \operatorname{conv}(A_j)\neq\emptyset.

This is a long-standing open problem concerning a colorful analogue of Tverberg's theorem.

Progress summary

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Sources & referencesView supporting material

Primary source

Pablo Soberón, “Robust Tverberg and colorful Carathéodory results via random choice”, arXiv:1606.08790 (2017).

Additional references

2 papers in this index state this conjecture (2016). The statement above is taken from the most recent of them; the others are arXiv:1605.07321.

Solutions 0

No solutions have been posted yet.