Tolerance for colorful Tverberg partitions

DOI10.1016/J.EJC.2022.103527zbMATH Open1487.05029arXiv2005.13495OpenAlexW3032629514MaRDI QIDQ2136209FDOQ2136209

Pablo Soberón, Sherry Sarkar

Publication date: 10 May 2022

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: Tverberg's theorem bounds the number of points $mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one point of each color. In this manuscript, we bound the number of color classes needed for the existence of partitions where the convex hulls of the parts intersect even after any set of $t$ colors is removed. We prove asymptotically optimal bounds for $t$ when $rled+1$, improve known bounds when $r>d+1$, and give a geometric characterization for the configurations of points for which $t=N-o(N)$.

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

Recommendations

• Equal coefficients and tolerance in coloured Tverberg partitions
• Equal coefficients and tolerance in coloured Tverberg partitions
• Algorithms for tolerated Tverberg partitions
• On the number of colored Birch and Tverberg partitions
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Polychromatic colorings of rectangular partitions
• The coloured Tverberg theorem
• Polychromatic colorings of arbitrary rectangular partitions
• STRONG COLORINGS OVER PARTITIONS
• scientific article; zbMATH DE number 1944647

zbMATH Keywords

Tverberg's theorempartition of a set of points

Mathematics Subject Classification ID

Partitions of sets (05A18) Helly-type theorems and geometric transversal theory (52A35)

Cites Work

• Probability Inequalities for Sums of Bounded Random Variables
• A generalization of Caratheodory's theorem
• A generalisation of Tverberg's theorem
• A Generalization of Radon's Theorem
• Very colorful theorems
• The colored Tverberg's problem and complexes of injective functions
• Tverberg's theorem via number fields
• Optimal bounds for the colored Tverberg problem
• A Colored Version of Tverberg's Theorem
• On Sets Projectively Equivalent to the Vertices of a Convex Polytope
• Optimal bounds for a colorful Tverberg-Vrećica type problem
• Tverberg plus constraints
• Equal coefficients and tolerance in coloured Tverberg partitions
• Title not available (Why is that?)
• Tverberg's Theorem at 50: Extensions and Counterexamples
• Tverberg’s theorem is 50 years old: A survey
• Robust Tverberg and Colourful Carathéodory Results via Random Choice
• The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
• New lower bounds for Tverberg partitions with tolerance in the plane
• Tverberg partitions as weak epsilon-nets
• A note on the Tolerant Tverberg Theorem
• Algorithms for Tolerated Tverberg Partitions

Cited In (4)

• New lower bounds for Tverberg partitions with tolerance in the plane
• Tverberg’s theorem is 50 years old: A survey
• ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
• Equal coefficients and tolerance in coloured Tverberg partitions

This page was built for publication: Tolerance for colorful Tverberg partitions

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