Convex fair partitions into arbitrary number of pieces

A. Akopyan, S. Avvakumov, R. Karasev, (2018).

Preprint | Published | English
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
Page
11
IST-REx-ID
75

Cite this

Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018.
Akopyan, A., Avvakumov, S., & Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv.
Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018.
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.
Akopyan, Arseniy, et al. Convex Fair Partitions into Arbitrary Number of Pieces. 1804.03057, arXiv, 2018.
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
OA Open Access
Material in IST:
Dissertation containing IST record

Export

Marked Publications

Open Data IST Research Explorer

Sources

arXiv 1804.03057

Search this title in

Google Scholar