Optimal bounds for the colored Tverberg problem (Q2344495): Difference between revisions

The main result of this paper is the following ``Tverberg type'' multiple intersection theorem: Let \(r \geq 2\) be prime, \(d \geq 1\), and \(N = (r - 1)(d +1)\). Let \(\Delta_N\) be an \(N\)-dimensional simplex, and \(\{C_0,\dots,C_m\}\) be a \((m + 1)\)-partition of its vertices, with \(|C_i| \leq r -1\) for all \(i\). Then for every continuous map \(f: \Delta_N \rightarrow \mathbb{R}^d\) there exist \(r\) disjoint faces \(F_1, \dots, F_r\) of \(\Delta_N\) such that: (a) \(|C_i \cap F_j| \leq 1\) for every \((i,j) \in \{0, \dots, m\} \times \{1, \dots, r\}\); (b) \(f(F_1)\cap \dots \cap f(F_r) \neq\emptyset\). The above theorem provides an improved bound for the (topological) colored Tverberg problem of \textit{I. Bárány} and \textit{D. G. Larman} [J. Lond. Math. Soc., II. Ser. 45, No. 2, 314--320 (1992; Zbl 0769.52008)] that is tight in the prime case and asymptotically optimal in the general case.