An extension of a theorem by Yao & Yao
Abstract
In this paper we study Nd(k) the smallest positive integer such that any nice measure μ in d can be partitioned in Nd(k) parts of equal measure so that every hyperplane avoids at least k of them. A theorem of Yao and Yao YY1985 states that Nd(1) 2d. Among other results, we obtain the bounds Nd(2) 3 · 2d-1 and Nd(1) C · 2d/2 for some constant C. We then apply these results to a problem on the separation of points and hyperplanes.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.