preprint
Convex fair partitions into arbitrary number of pieces
published
Arseniy
Akopyan
author 430D2C90-F248-11E8-B48F-1D18A9856A87
Sergey
Avvakumov
author 3827DAC8-F248-11E8-B48F-1D18A9856A87
Roman
Karasev
author
HeEd
department
JaMa
department
Optimal Transport and Stochastic Dynamics
project
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 give a higher-dimensional generalization.
ArXiv2018
eng
ArXiv
1804.03057
11
Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” <i>ArXiv</i>. ArXiv, 2018.
Akopyan, Arseniy, et al. “Convex Fair Partitions into Arbitrary Number of Pieces.” <i>ArXiv</i>, ArXiv, 2018.
Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. <i>ArXiv</i>. ArXiv.
Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. <i>ArXiv</i>. 2018.
A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces,” <i>ArXiv</i>. ArXiv, 2018.
A. Akopyan, S. Avvakumov, R. Karasev, ArXiv (2018).
Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. ArXiv.
752018-12-11T11:44:30Z2019-08-02T12:39:30Z