English
Related papers

Related papers: A Slight Improvement to the Colored B\'ar\'any's T…

200 papers

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in general position in \R^d is contained in at least (d+1)^2/2 simplices with one vertex from each set. This improves the known lower bounds for all d >= 4.

Combinatorics · Mathematics 2010-06-01 Antoine Deza , Tamon Stephen , Feng Xie

The point selection theorem says that the convex hull of any finite point set contains a point that lies in a positive proportion of the simplices determined by that set. This paper proves several new volumetric versions of this theorem…

Metric Geometry · Mathematics 2025-08-26 Travis Dillon

Holmsen, Kyn\v{c}l and Valculescu recently conjectured that if a finite set $X$ with $\ell n$ points in $\mathbb{R}^d$ that is colored by $m$ different colors can be partitioned into $n$ subsets of $\ell$ points each, such that each subset…

Combinatorics · Mathematics 2019-12-04 Pavle V. M. Blagojević , Nevena Palić , Pablo Soberón , Günter M. Ziegler

We show that any $d$-colored set of points in general position in $\mathbb{R}^d$ can be partitioned into $n$ subsets with disjoint convex hulls such that the set of points and all color classes are partitioned as evenly as possible. This…

Combinatorics · Mathematics 2019-04-04 Pavle V. M. Blagojević , Günter Rote , Johanna K. Steinmeyer , Günter M. Ziegler

We examine how the measure and the number of vertices of the convex hull of a random sample of $n$ points from an arbitrary probability measure in $\mathbf{R}^d$ relates to the wet part of that measure. This extends classical results for…

Probability · Mathematics 2020-10-13 Imre Bárány , Matthieu Fradelizi , Xavier Goaoc , Alfredo Hubard , Günter Rote

We generalize the ham sandwich theorem to $d+1$ measures in $\mathbb{R}^d$ as follows. Let $\mu_1,\mu_2, \dots, \mu_{d+1}$ be absolutely continuous finite Borel measures on $\mathbb{R}^d$. Let $\omega_i=\mu_i(\mathbb{R}^d)$ for $i\in…

Metric Geometry · Mathematics 2018-12-18 Mikio Kano , Jan Kynčl

Given $d+1$ sets of points, or colours, $S_1,\ldots,S_{d+1}$ in $\mathbb R^d$, a colourful simplex is a set $T\subseteq\bigcup_{i=1}^{d+1}S_i$ such that $|T\cap S_i|\leq 1$, for all $i\in\{1,\ldots,d+1\}$. The colourful Carath\'eodory…

Combinatorics · Mathematics 2014-04-16 Pauline Sarrabezolles

We present a motivated exposition of the proof of the following Tverberg Theorem: For every integers $d,r$ any $(d+1)(r-1)+1$ points in $\mathbb R^d$ can be decomposed into $r$ groups such that all the $r$ convex hulls of the groups have a…

Combinatorics · Mathematics 2021-12-15 V. Retinskiy , A. Ryabichev , A. Skopenkov

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…

Combinatorics · Mathematics 2011-06-02 Jiří Matoušek , Martin Tancer , Uli Wagner

We study $\mathbb{R}^2\oplus\mathbb{R}$-separately convex hulls of finite sets of points in $\mathbb{R}^3$, as in KirchheimMullerSverak2003. This notion of convexity, which we call $2+1$ convexity, corresponds to rank-one convex convexity,…

Analysis of PDEs · Mathematics 2022-09-30 Pablo Angulo , Carlos García-Gutiérrez

The classical theorem of Wendel provides an exact formula for the probability that the convex hull of independent symmetrically distributed vectors in ${\mathbb R}^d$ contains the origin as long as the distributions of the vectors are…

Metric Geometry · Mathematics 2025-08-12 Konstantin Tikhomirov

Let $C_1,\dots,C_{d+1}\subset \mathbb{R}^d$ be $d+1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots, p_{d+1}$ with $p_i \in C_i$, for $i = 1, \dots, d+1$, a…

Computational Geometry · Computer Science 2018-08-31 Wolfgang Mulzer , Yannik Stein

The well know theorem of Tverberg states that if n > (d+1)(r-1) then one can partition any set of n points in R^d to r disjoint subsets whose convex hulls have a common point. The numbers T(d,r) = (d + 1)(r - 1) + 1 are known as Tverberg…

Combinatorics · Mathematics 2014-09-11 Micha A. Perles , Moriah Sigron

Steinitz's theorem states that if a point $a \in \mathrm{int\,conv\,} X$ for a set $X \subset \mathbb{R}^d$, then $X$ contains a subset $Y$ of size at most $2d$ such that $a \in \mathrm{int\,conv\,}Y$. The bound $2d$ is best possible here.…

Combinatorics · Mathematics 2026-03-13 Imre Bárány , Yun Qi

Given $d+1$ sets, or colours, $S_1, S_2,...,S_{d+1}$ of points in $\mathbb{R}^d$, a {\em colourful} set is a set $S\subseteq\bigcup_i S_i$ such that $|S\cap S_i|\leq 1$ for $i=1,...,d+1$. The convex hull of a colourful set $S$ is called a…

Computational Geometry · Computer Science 2014-03-07 Frédéric Meunier , Antoine Deza

We show that any point in the convex hull of each of (d+1) sets of (d+1) points in R^d is contained in at least floor((d+2)^2/4) simplices with one vertex from each set.

Combinatorics · Mathematics 2007-07-23 Tamon Stephen , Hugh Thomas

We will prove the following generalization of the ham sandwich Theorem, conjectured by Imre B\'ar\'any. Given a positive integer $k$ and $d$ nice measures $\mu_1, \mu_2,..., \mu_d$ in $\mathbb{R}^d$ such that $\mu_i (\mathds{R}^d) = k$ for…

Metric Geometry · Mathematics 2012-02-23 Pablo Soberón

In this paper we give an alternative, purely Conley index based proof of the Arnold conjecture in $\mathbb C\mathbb P^n$ asserting that a Hamiltonian diffeomorphism of $\mathbb C\mathbb P^n$ endowed with the Fubini-Study metric has at least…

Dynamical Systems · Mathematics 2022-02-02 L. Asselle , M. Izydorek , M. Starostka

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

Statistics Theory · Mathematics 2013-11-13 Victor-Emmanuel Brunel

This paper presents a new variation of Tverberg's theorem. Given a discrete set $S$ of $R^d$, we study the number of points of $S$ needed to guarantee the existence of an $m$-partition of the points such that the intersection of the $m$…

Metric Geometry · Mathematics 2016-03-21 J. A. De Loera , R. N. La Haye , D. Rolnick , P. Soberón
‹ Prev 1 2 3 10 Next ›