On the Number of Colored Birch and Tverberg Partitions

Stephan Hell


In 2009, Blagojević, Matschke, and Ziegler established the first tight colored Tverberg theorem. We develop a colored version of our previous results (2008): 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.


Discrete geometry; Tverberg partitions

Full Text: PDF