Convex fair partitions into an arbitrary number of pieces
Convex fair partitions into an arbitrary number of pieces
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\ge 2$; this result was previously known for prime powers $m=p^k$. We also discuss possible higher-dimensional generalizations and difficulties of extending our technique to equalizing more than one non-additive function.
Arseniy Akopyan、Sergey Avvakumov、Roman Karasev
数学
Arseniy Akopyan,Sergey Avvakumov,Roman Karasev.Convex fair partitions into an arbitrary number of pieces[EB/OL].(2025-08-13)[2025-08-24].https://arxiv.org/abs/1804.03057.点此复制
评论