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