On the number of colored Birch and Tverberg partitions (Q405313)

Summary: \textit{P. V. M. Blagojević} et al. [``Optimal bounds for the colorful Tverberg problem'', Preprint, \url{arXiv:0910.4987}] established the first tight colored Tverberg~theorem. We develop a colored version of our previous results [the author, Discrete Comput. Geom. 40, No. 4, 586--594 (2008; Zbl 1169.05008)]: Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. Both properties follow from similar results on the number of colored Birch partitions.