On the number of colored Birch and Tverberg partitions (Q405313)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of colored Birch and Tverberg partitions |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of colored Birch and Tverberg partitions |
scientific article |
Statements
On the number of colored Birch and Tverberg partitions (English)
0 references
4 September 2014
0 references
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.
0 references
discrete geometry
0 references
Tverberg partitions
0 references
0.8434067964553833
0 references
0.8032594919204712
0 references
0.7926663160324097
0 references
0.7914790511131287
0 references
0.7849411368370056
0 references
