A geometric proof of the colored Tverberg theorem

DOI10.1007/S00454-011-9368-2MaRDI QIDQ664361zbMATH OpenOpenAlexWikidataFDO

Authors Martin Tancer, Uli Wagner, Jiří Matoušek

Publication date 1 March 2012

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

colored Tverberg theoremcontinuous motionconvexityTverberg's theorem

Mathematics Subject Classification ID

Partitions of sets (05A18) Helly-type theorems and geometric transversal theory (52A35) Other problems of combinatorial convexity (52A37) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Relations of low-dimensional topology with graph theory (57M15)

Abstract: The colored Tverberg theorem asserts that for every d and r there exists t=t(d,r) such that for every set C in R^d of cardinality (d+1)t, partitioned into t-point subsets C_1,C_2,...,C_{d+1} (which we think of as color classes; e.g., the points of C_1 are red, the points of C_2 blue, etc.), there exist r disjoint sets R_1,R_2,...,R_r subseteq C that are "rainbow", meaning that |R_i cap C_j| < 2 for every i,j, and whose convex hulls all have a common point. All known proofs of this theorem are topological. We present a geometric version of a recent beautiful proof by Blagojevi'c, Matschke, and Ziegler, avoiding a direct use of topological methods. The purpose of this de-topologization is to make the proof more concrete and intuitive, and accessible to a wider audience.

Recommendations

• A Colored Version of Tverberg's Theorem
• Note on the colored Tverberg theorem
• The colored Tverberg's problem and complexes of injective functions
• scientific article; zbMATH DE number 718867

Cites work

• A Colored Version of Tverberg's Theorem
• A combinatorical proof of Kneser's conjecture
• A Generalization of Radon's Theorem
• A generalization of Radon's theorem II
• A Generalized van Kampen-Flores Theorem
• Chessboard Complexes and Matching Complexes
• Chessboard complexes indomitable
• Convex Polytopes
• Generalized Kneser coloring theorems with combinatorial proofs
• scientific article; zbMATH DE number 1749054 (Why is no real title available?)
• scientific article; zbMATH DE number 940709 (Why is no real title available?)
• scientific article; zbMATH DE number 850072 (Why is no real title available?)
• Note on the colored Tverberg theorem
• On a common generalization of Borsuk's and Radon's theorem
• On a Topological Generalization of a Theorem of Tverberg
• On the number of halving planes
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• Optimal bounds for the colored Tverberg problem
• The colored Tverberg's problem and complexes of injective functions
• Tverberg's theorem via number fields
• User's guide to equivariant methods in combinatorics. II

Cited in

(12)

• The coloured Tverberg theorem
• Note on the colored Tverberg theorem
• No-dimensional Tverberg theorems and algorithms
• Optimal bounds for the colored Tverberg problem
• Colored topological Tverberg theorem of Blagojević, Matschke and Ziegler
• A Colored Version of Tverberg's Theorem
• On the number of colored Birch and Tverberg partitions
• scientific article; zbMATH DE number 718867 (Why is no real title available?)
• A User's guide to the topological Tverberg conjecture
• Chessboard complexes indomitable
• Invariants of graph drawings in the plane
• An elementary proof of Tverberg's theorem

This page was built for publication: A geometric proof of the colored Tverberg theorem

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