Equal coefficients and tolerance in coloured Tverberg partitions
From MaRDI portal
Publication:520024
DOI10.1007/s00493-014-2969-7zbMath1374.52006arXiv1204.1202OpenAlexW2030174998MaRDI QIDQ520024
Publication date: 31 March 2017
Published in: Combinatorica, Proceedings of the twenty-ninth annual symposium on Computational geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.1202
Partitions of sets (05A18) Computational aspects related to convexity (52B55) Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37) Helly-type theorems and geometric transversal theory (52A35) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Tolerance for colorful Tverberg partitions ⋮ Tverberg plus constraints ⋮ A note on the Tolerant Tverberg Theorem ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ Beyond the Borsuk–Ulam Theorem: The Topological Tverberg Story ⋮ Regular polygonal partitions of a Tverberg type ⋮ Robust Tverberg and Colourful Carathéodory Results via Random Choice ⋮ Tverberg plus minus ⋮ Quantitative combinatorial geometry for continuous parameters ⋮ Algorithms for Radon partitions with tolerance ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ No-dimensional Tverberg theorems and algorithms ⋮ Helly-type problems
Cites Work
- Unnamed Item
- A generalisation of Tverberg's theorem
- Chessboard complexes indomitable
- Tolerance in Helly-type theorems
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- A geometric proof of the colored Tverberg theorem
- On the number of Tverberg partitions in the prime power case
- Tverberg's theorem with constraints
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- The solution of van der Waerden's problem for permanents
- A generalization of Caratheodory's theorem
- The colored Tverberg's problem and complexes of injective functions
- The partition conjecture
- Note on a conjecture of Sierksma
- Tverberg's theorem via number fields
- Optimal bounds for the colored Tverberg problem
- Very colorful theorems
- A theorem on families of sets
- On the number of halving planes
- A Generalized van Kampen-Flores Theorem
- A Colored Version of Tverberg's Theorem
- Convex Polytopes
- A Generalization of Radon's Theorem
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope
- 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
- Notes on the topological Tverberg theorem
