Sierksma's Dutch Cheese Problem
Abstract
Consider partitions, of a cardinality (q-1)(d+1)+1 generic subset of euclidean d-space, into q parts whose convex hulls have a nonempty intersection. We show that if these partitions are counted with appropriate signs 1 then the answer is always ((q-1)!)d. Also some other related results are given.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.