{"date_updated":"2023-12-18T10:51:02Z","article_processing_charge":"No","month":"09","external_id":{"arxiv":["1804.03057"]},"author":[{"last_name":"Akopyan","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X"},{"id":"3827DAC8-F248-11E8-B48F-1D18A9856A87","full_name":"Avvakumov, Sergey","last_name":"Avvakumov","first_name":"Sergey"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"day":"13","doi":"10.48550/arXiv.1804.03057","type":"preprint","main_file_link":[{"url":"https://arxiv.org/abs/1804.03057","open_access":"1"}],"abstract":[{"lang":"eng","text":"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."}],"_id":"75","article_number":"1804.03057","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"},{"_id":"JaMa"}],"publication_status":"published","citation":{"mla":"Akopyan, Arseniy, et al. <i>Convex Fair Partitions into Arbitrary Number of Pieces</i>. 1804.03057, arXiv, 2018, doi:<a href=\"https://doi.org/10.48550/arXiv.1804.03057\">10.48550/arXiv.1804.03057</a>.","ieee":"A. Akopyan, S. Avvakumov, and R. Karasev, “Convex fair partitions into arbitrary number of pieces.” arXiv, 2018.","apa":"Akopyan, A., Avvakumov, S., &#38; Karasev, R. (2018). Convex fair partitions into arbitrary number of pieces. arXiv. <a href=\"https://doi.org/10.48550/arXiv.1804.03057\">https://doi.org/10.48550/arXiv.1804.03057</a>","ista":"Akopyan A, Avvakumov S, Karasev R. 2018. Convex fair partitions into arbitrary number of pieces. 1804.03057.","chicago":"Akopyan, Arseniy, Sergey Avvakumov, and Roman Karasev. “Convex Fair Partitions into Arbitrary Number of Pieces.” arXiv, 2018. <a href=\"https://doi.org/10.48550/arXiv.1804.03057\">https://doi.org/10.48550/arXiv.1804.03057</a>.","ama":"Akopyan A, Avvakumov S, Karasev R. Convex fair partitions into arbitrary number of pieces. 2018. doi:<a href=\"https://doi.org/10.48550/arXiv.1804.03057\">10.48550/arXiv.1804.03057</a>","short":"A. Akopyan, S. Avvakumov, R. Karasev, (2018)."},"date_published":"2018-09-13T00:00:00Z","ec_funded":1,"year":"2018","publisher":"arXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:44:30Z","oa_version":"Preprint","oa":1,"project":[{"call_identifier":"H2020","grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","_id":"256E75B8-B435-11E9-9278-68D0E5697425"}],"status":"public","related_material":{"record":[{"relation":"dissertation_contains","id":"8156","status":"public"}]},"title":"Convex fair partitions into arbitrary number of pieces"}