%0 Journal Article
%T Sierksma's Dutch Cheese Problem
%A K. S. Sarkaria
%J Mathematics
%D 1997
%I arXiv
%X 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 $\pm 1$ then the answer is always $((q-1)!)^d$. Also some other related results are given.
%U http://arxiv.org/abs/math/9703208v1