Chessboard complexes indomitable
From MaRDI portal
Abstract: We give an alternative proof of the striking new Tverberg type theorem of Blagojevic and Ziegler, arXiv:0910.4987v1 [math.CO]. Our method also yields some new cases of "constrained Tverberg thereom" in the sense of Hell, including a simple colored Radon's theorem for d+3 points in R^d. This is a final version of the paper with improved presentation, corrected typos and added references.
Recommendations
Cites work
- scientific article; zbMATH DE number 718867 (Why is no real title available?)
- scientific article; zbMATH DE number 2107521 (Why is no real title available?)
- A Colored Version of Tverberg's Theorem
- A comparison of two naturally arising uniformities on a class of pseudo- PM spaces
- Chessboard Complexes and Matching Complexes
- Cycle-free chessboard complexes and symmetric homology of algebras
- Decompositions and connectivity of matching and chessboard complexes
- Exact sequences for the homology of the matching complex
- Geometric methods in degree theory for equivariant maps
- Minimal resolutions and the homology of matching and chessboard complexes
- On generalizations of Radon's theorem and the Ham sandwich theorem
- On the 3-torsion part of the homology of the chessboard complex
- On the Betti numbers of chessboard complexes
- On the number of halving planes
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Optimal bounds for the colored Tverberg problem
- Shellability of chessboard complexes
- Simplicial complexes of graphs
- The Tverberg-Vrećica problem and the combinatorial geometry on vector bundles
- The colored Tverberg's problem and complexes of injective functions
- Topology of matching, chessboard, and general bounded degree graph complexes
- Torsion in the matching complex and chessboard complex
- Transformation groups
- Tverberg's theorem with constraints
- User's guide to equivariant methods in combinatorics. II
- 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
Cited in
(15)- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Intransitively winning chess players positions
- A geometric proof of the colored Tverberg theorem
- Envy-free division via configuration spaces
- On the number of colored Birch and Tverberg partitions
- Tverberg's Theorem at 50: Extensions and Counterexamples
- The topological Tverberg theorem and related topics
- Wazir Circuits on an Obstructed Chessboard
- Tverberg plus constraints
- Envy-free division in the presence of a dragon
- Average-value Tverberg partitions via finite Fourier analysis
- Multiple chessboard complexes and the colored Tverberg problem
- Symmetric multiple chessboard complexes and a new theorem of Tverberg type
- Generalized chessboard complexes and discrete Morse theory
- Optimal bounds for the colored Tverberg problem
This page was built for publication: Chessboard complexes indomitable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q549260)