Convex fair partitions into an arbitrary number of pieces

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Akopyan, A., Avvakumov, S., & Karasev, R. (2026). Convex fair partitions into an arbitrary number of pieces. Advances in Mathematics, 493. https://doi.org/10.1016/j.aim.2026.110927

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free