English
Related papers

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

200 papers

Let $C_1,...,C_{d+1}$ be $d+1$ point sets in $\mathbb{R}^d$, each containing the origin in its convex hull. A subset $C$ of $\bigcup_{i=1}^{d+1} C_i$ is called a colorful choice (or rainbow) for $C_1, \dots, C_{d+1}$, if it contains exactly…

Computational Geometry · Computer Science 2016-08-08 Frédéric Meunier , Wolfgang Mulzer , Pauline Sarrabezolles , Yannik Stein

We generalize the ham sandwich theorem for the case of well separated measures. Given convex bodies $K_1,...,K_d$ in $\mathbb{R_d}$ and numbers $\alpha_1,...,\alpha_d \in [0, 1]$, we give a sufficient condition for existence and uniqueness…

Combinatorics · Mathematics 2010-11-01 Imre Barany , Alfredo Hubard , Jesus Jeronimo

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

We prove several results of the following type: any $d$ measures in $\mathbb R^d$ can be partitioned simultaneously into $k$ equal parts by a convex partition (this particular result is proved independently by Pablo Sober\'on). Another…

Metric Geometry · Mathematics 2013-06-17 R. N. Karasev

A seminal theorem of Tverberg states that any set of $T(r,d)=(r-1)(d+1)+1$ points in $\mathbb{R}^d$ can be partitioned into $r$ subsets whose convex hulls have non-empty $r$-fold intersection. Almost any collection of fewer points in…

Combinatorics · Mathematics 2023-11-10 Leah Leiner , Steven Simon

We give new proofs of the description convex hulls of space curves $\gamma : [a,b] \mapsto \mathbb{R}^{d}$ having totally positive torsion. These are curves such that all the leading principal minors of $d\times d$ matrix $(\gamma',…

Probability · Mathematics 2023-01-05 Jaume de Dios Pont , Paata Ivanisvili , José Madrid

We show that the problem of finding the simplex of largest volume in the convex hull of $n$ points in $\mathbb{Q}^d$ can be approximated with a factor of $O(\log d)^{d/2}$ in polynomial time. This improves upon the previously best known…

Computational Geometry · Computer Science 2014-06-16 Marco Di Summa , Friedrich Eisenbrand , Yuri Faenza , Carsten Moldenhauer

A result of Boros and F\"uredi ($d=2$) and of B\'ar\'any (arbitrary $d$) asserts that for every $d$ there exists $c_d>0$ such that for every $n$-point set $P\subset \R^d$, some point of $\R^d$ is covered by at least $c_d{n\choose d+1}$ of…

Combinatorics · Mathematics 2016-08-14 Jiří Matoušek , Uli Wagner

Pick $N$ random points $U_1,\cdots,U_{N}$ independently and uniformly in a triangle ABC with area 1, and take the convex hull of the set $\{A,B,U_1,\cdots,U_{N}\}$. The boundary of this convex hull is a convex chain $V_0=B,V_1,\cdots,$…

Probability · Mathematics 2025-10-31 Jean-François Marckert , Ludovic Morin

Let $A,B \subseteq \mathbb{R}^d $ both span $\mathbb{R}^d$ such that $\langle a, b \rangle \in \{0,1\}$ holds for all $a \in A$, $b \in B$. We show that $ |A| \cdot |B| \le (d+1) 2^d $. This allows us to settle a conjecture by Bohn, Faenza,…

Combinatorics · Mathematics 2020-08-18 Andrey Kupavskii , Stefan Weltge

In this paper, we construct a natural probability measure on the space of real branched coverings from a real projective algebraic curve $(X,c_X)$ to the projective line $(\mathbb{C}\mathbb{P}^1,\textrm{conj})$. We prove that the space of…

Algebraic Geometry · Mathematics 2021-02-17 Michele Ancona

The ellipsoid fitting conjecture of Saunderson, Chandrasekaran, Parrilo and Willsky considers the maximum number $n$ random Gaussian points in $\mathbb{R}^d$, such that with high probability, there exists an origin-symmetric ellipsoid…

Probability · Mathematics 2023-07-25 Madhur Tulsiani , June Wu

In this paper we give an improved upper bound, as compared to the one given in [3] for the number of extreme points of the convex set of all G-invariant probability measures on X*Y with given marginals of full support.

General Mathematics · Mathematics 2010-03-17 M. G. Nadkarni , K. Gowri Navada

Let us consider the set of all joint probabilities generated by local binary measurements on two separated quantum systems of a given local dimension d. We address the question of whether the shape of this quantum body is convex or not. We…

Quantum Physics · Physics 2015-05-13 K. F. Pál , T. Vértesi

We show by a direct construction that there are at least $\exp\{cV^{(d-1)/(d+1)}\}$ convex lattice polytopes in $\mathbb{R}^d$ of volume $V$ that are different in the sense that none of them can be carried to an other one by a lattice…

Combinatorics · Mathematics 2014-03-06 Imre Barany , Liping Yuan

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

Number Theory · Mathematics 2014-02-26 Roland Bacher

The Topological Tverberg Theorem claims that any continuous map of a (q-1)(d+1)-simplex to \R^d identifies points from q disjoint faces. (This has been proved for affine maps, for d=1, and if q is a prime power, but not yet in general.) The…

Combinatorics · Mathematics 2007-05-23 Torsten Schöneborn , Günter M. Ziegler

B\'ar\'any, Katchalski and Pach proved the following quantitative form of Helly's theorem. If the intersection of a family of convex sets in $\mathbb{R}^d$ is of volume one, then the intersection of some subfamily of at most $2d$ members is…

Metric Geometry · Mathematics 2015-03-26 Marton Naszodi

Giving a joint generalization of a result of Brazitikos, Chasapis and Hioni and results of Giannopoulos and Milman, we prove that roughly $\left\lceil \frac{d}{(1-\vartheta)^d}\ln\frac{1}{(1-\vartheta)^d} \right\rceil$ points chosen…

Metric Geometry · Mathematics 2017-05-23 Márton Naszódi

Given $S= \{v_1, \dots, v_n\} \subset \mathbb{R} ^m$ and $p \in \mathbb{R} ^m$, testing if $p \in conv(S)$, the convex hull of $S$, is a fundamental problem in computational geometry and linear programming. First, we prove a Euclidean {\it…

Computational Geometry · Computer Science 2013-10-15 Bahman Kalantari