Optimal bounds for a colorful Tverberg--Vrecica type problem
@article{Blagojevic2009OptimalBF, title={Optimal bounds for a colorful Tverberg--Vrecica type problem}, author={P. Blagojevic and B. Matschke and G. Ziegler}, journal={arXiv: Algebraic Topology}, year={2009} }
We prove the following optimal colorful Tverberg-Vrecica type transversal theorem: For prime r and for any k+1 colored collections of points C^l of size |C^l|=(r-1)(d-k+1)+1 in R^d, where each C^l is a union of subsets (color classes) C_i^l of size smaller than r, l=0,...,k, there are partition of the collections C^l into colorful sets F_1^l,...,F_r^l such that there is a k-plane that meets all the convex hulls conv(F_j^l), under the assumption that r(d-k) is even or k=0.
Along the proof we… Expand
42 Citations
Equal coefficients and tolerance in coloured Tverberg partitions
- Mathematics, Computer Science
- Comb.
- 2015
- 16
A Geometric Proof of the Colored Tverberg Theorem
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2012
- 15
- PDF
Equal coefficients and tolerance in coloured tverberg partitions
- Mathematics, Computer Science
- SoCG '13
- 2013
- 10
Robust Tverberg and Colourful Carathéodory Results via Random Choice
- Mathematics, Computer Science
- Combinatorics, Probability and Computing
- 2017
- 8
- PDF
Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
- Mathematics, Computer Science
- Symposium on Computational Geometry
- 2014
- 33
- PDF
References
SHOWING 1-10 OF 27 REFERENCES
Tverberg's Transversal Conjecture and Analogues of Nonembeddability Theorems for Transversals
- Mathematics, Computer Science
- Discret. Comput. Geom.
- 2007
- 17
- PDF