Robust Tverberg and Colourful Carathéodory Results via Random Choice

DOI10.1017/S0963548317000591zbMath1387.52012arXiv1606.08790MaRDI QIDQ4635512

Pablo Soberón

Publication date: 23 April 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

zbMATH Keywords

probabilistic methodcolourful Carathéodory theoremTverberg's theorem with tolerance

Mathematics Subject Classification ID

Helly-type theorems and geometric transversal theory (52A35) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items (9)

Stochastic Tverberg Theorems With Applications in Multiclass Logistic Regression, Separability, and Centerpoints of Data ⋮ Tolerance for colorful Tverberg partitions ⋮ Fair distributions for more participants than allocations ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes ⋮ A sparse colorful polytopal KKM theorem ⋮ Algorithms for Radon partitions with tolerance ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalisation of Tverberg's theorem
• Projective equivalences of \(k\)-neighbourly polytopes
• Some variations on Tverberg's theorem
• Equal coefficients and tolerance in coloured Tverberg partitions
• Tolerance in Helly-type theorems
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• A deterministic view of random sampling and its use in geometry
• The intersection of a matroid and an oriented matroid
• Points surrounding the origin
• \(\epsilon\)-nets and simplex range queries
• Several generalizations of Tverberg's theorem
• A generalization of Caratheodory's theorem
• On Reay's relaxed Tverberg conjecture and generalizations of Conway's thrackle conjecture
• Tverberg's theorem via number fields
• New applications of random sampling in computational geometry
• Optimal bounds for the colored Tverberg problem
• Very colorful theorems
• A note on the Tolerant Tverberg Theorem
• Algorithms for Tolerated Tverberg Partitions
• Tverberg plus constraints
• Tensors, colours, octahedra
• Crossing-Free Subgraphs
• A Colored Version of Tverberg's Theorem
• Crossing Numbers and Hard Erdős Problems in Discrete Geometry
• Colourful Linear Programming and its Relatives
• A Generalization of Radon's Theorem
• Approximate center points with proofs
• On Sets Projectively Equivalent to the Vertices of a Convex Polytope
• APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
• 10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope

This page was built for publication: Robust Tverberg and Colourful Carathéodory Results via Random Choice