On the number of colored Birch and Tverberg partitions
The electronic journal of combinatorics, Tome 21 (2014) no. 3
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.
DOI :
10.37236/3450
Classification :
05A18, 05A15, 11P83, 52A20
Mots-clés : discrete geometry, Tverberg partitions
Mots-clés : discrete geometry, Tverberg partitions
@article{10_37236_3450,
author = {Stephan Hell},
title = {On the number of colored {Birch} and {Tverberg} partitions},
journal = {The electronic journal of combinatorics},
year = {2014},
volume = {21},
number = {3},
doi = {10.37236/3450},
zbl = {1300.05037},
url = {http://geodesic.mathdoc.fr/articles/10.37236/3450/}
}
Stephan Hell. On the number of colored Birch and Tverberg partitions. The electronic journal of combinatorics, Tome 21 (2014) no. 3. doi: 10.37236/3450
Cité par Sources :