Theorem 1. For any integers r, d>1 there exists an integer T=T(d, r), such that given sets A 1 , ..., A d+1 /R d in general position, consisting of T points each, one can find disjoint (d+1)-point sets S 1 , ..., S r such that each S i contains exactly one point of each A j , j=1, 2, ..., d+1, and t
A Geometric Proof of the Colored Tverberg Theorem
✍ Scribed by Jiří Matoušek; Martin Tancer; Uli Wagner
- Publisher
- Springer
- Year
- 2011
- Tongue
- English
- Weight
- 739 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0179-5376
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Hollmann, Ko rner, and Litsyn used generalized Steiner systems to prove that it is impossible to partition an n-cube into k Hamming spheres if 2<k<n+2. Furthermore, if k=n+2, they showed the only partition of the n-cube consists of a single sphere of radius n&2 and n+1 spheres of radius 0. We give a
An extension of the Kruskal-Katona theorem to colored hypergraphs was given by Frankl, Fiiredi and Kalai in [Shadows of colored complexes, Mathematics Scandinavica]. Here we give a new simple proof.
## Abstract For block‐partitioned matrices of the __GI/M/__1 type, it has been shown by M. F. Neuts that the stationary probability vector, when it exists, has a matrix‐geometric form. We present here a new proof, which we believe to be the simplest available today.