On the number of colored Birch and Tverberg partitions

From MaRDI portal
Publication:405313

zbMATH Open1300.05037arXiv1208.0509MaRDI QIDQ405313FDOQ405313


Authors: Stephan Hell Edit this on Wikidata


Publication date: 4 September 2014

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: In 2009, Blagojevic, Matschke & Ziegler established the first tight colored Tverberg theorem, but no lower bounds for the number of colored Tverberg partitions. We develop a colored version of our previous results (2008), and we extend our results from the uncolored version: Evenness and non-trivial lower bounds for the number of colored Tverberg partitions. This follows from similar results on the number of colored Birch partitions.


Full work available at URL: https://arxiv.org/abs/1208.0509

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (6)





This page was built for publication: On the number of colored Birch and Tverberg partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q405313)