The hamburger theorem

Abstract

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 [d+1]$, $\omega =\min \{{\omega }_i;i\in [d+1]\}$ and assume that ${\sum }_{j=1}^{d+1}{\omega }_j=1$. Assume that ${\omega }_i\le 1/d$ for every $i\in [d+1]$. Then there exists a hyperplane $h$ such that each open halfspace $H$ defined by $h$ satisfies ${\mu }_i(H)\le ({\sum }_{j=1}^{d+1}{\mu }_j(H))/d$ for every $i\in [d+1]$ and ${\sum }_{j=1}^{d+1}{\mu }_j(H)\ge \min (1/2,1-d\omega )\ge 1/(d+1)$. As a consequence we obtain that every $(d+1)$-colored set of $nd$ points in ${\mathbb{R}}^d$ such that no color is used for more than $n$ points can be partitioned into $n$ disjoint rainbow $(d-1)$-dimensional simplices.

11 pages, 2 figures; a new proof of Theorem 8, extended concluding remarks

References in corpus (1)

• Uneven Splitting of Ham Sandwiches

Cited by in corpus (1)

• Rainbow polygons for colored point sets in the plane