# Sierksma's Dutch Cheese Problem

Source: [Sierksma's Dutch Cheese Problem](<https://www.sota2.com/research/paper/68fa4e591e209131ce95b959>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T09:47:53.065Z

Authors: K. S. Sarkaria

Published: 1997-03-24T00:00:00.000Z

## 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 $\\pm 1$ then the answer is always $((q-1)!)^d$. Also some other related results are given.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/math/9703208>)

[PDF](<https://arxiv.org/pdf/math/9703208.pdf>)
