{"id":"palomar/PALOMAR-2026-08-31-000005","url":"https://github.com/akopjan/NRR-AAK/tree/9e57be63320f29cbb8d2da7c4a8ad6afdef681eb","json":"https://data.palomar-registry.org/entries/PALOMAR-2026-08-31-000005-v1.json","repo":"https://github.com/akopjan/NRR-AAK","tags":["math.MG","msc:52C35","msc:55M20","msc:55M35","convex-geometry","lean-formalization","equipartition"],"score":0,"title":"akopjan/NRR-AAK","trust":"high","domain":"math.MG","source":"palomar","authors":["Arseniy Akopyan"],"reviews":0,"subject":"math.MG","summary":"Formalization of the result by A. Akopyan, S. Avvakumov, and R. Karasev that every convex figure in the plane can be partitioned into n convex pieces having equal area and equal perimeter for any n≥1.","category":"research","comments":0,"disputed":false,"division":"math","mentions":0,"verified":true,"discussed":0,"published":"2026-08-31","reactions":{},"formalized":true,"formalizes":[{"title":"Convex fair partitions into an arbitrary number of pieces","identifier":"doi:10.1016/j.aim.2026.110927","relationship":"formalizes"}]}