Convex fair partitions into an arbitrary number of pieces

Abstract

We prove that any convex body in the plane can be partitioned into m convex parts of equal areas and perimeters for any integer m 2; this result was previously known for prime powers m=pk. We also discuss possible higher-dimensional generalizations and difficulties of extending our technique to equalizing more than one non-additive function.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…