On the number of colored Birch and Tverberg partitions
From MaRDI portal
(Redirected from Publication:405313)
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.
Recommendations
Cites work
- A Colored Version of Tverberg's Theorem
- A Generalization of Radon's Theorem
- A geometric proof of the colored Tverberg theorem
- Chessboard complexes indomitable
- Colourful simplicial depth
- Note on a conjecture of Sierksma
- On the number of Birch partitions
- On the number of Tverberg partitions in the prime power case
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler
- \(3N\) colored points in a plane
Cited in
(6)- \(3N\) coloured points in the plane
- scientific article; zbMATH DE number 6470123 (Why is no real title available?)
- Tverberg’s theorem is 50 years old: A survey
- Permanents of multidimensional matrices: properties and applications
- On the number of Birch partitions
- Tolerance for colorful Tverberg partitions
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)