Convex fair partitions into arbitrary number of pieces
Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.
Download (ext.)
Preprint
| Published
| English
Author
Department
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 give a higher-dimensional generalization.
Publishing Year
Date Published
2018-09-13
Article Number
1804.03057
IST-REx-ID
Cite this
Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:10.48550/arXiv.1804.03057
Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. https://doi.org/10.48550/arXiv.1804.03057
Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. https://doi.org/10.48550/arXiv.1804.03057.
A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.
Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.
Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018, doi:10.48550/arXiv.1804.03057.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]
Link(s) to Main File(s)
Access Level
Open Access
Material in ISTA:
Dissertation containing ISTA record
Export
Marked PublicationsOpen Data ISTA Research Explorer
Sources
arXiv 1804.03057
Google Scholar