Convex equipartitions via equivariant obstruction theory (Q2017153)

A lovely conjecture of Nandakumar and Rao from 2006 states that every convex polygon in the plane can be partitioned into any \(n\) number of convex pieces that have equal area and equal perimeter. This elegant paper settles this conjecture positively when \(n\) is a prime power. Indeed, more is accomplished, as this result is proven for partitions of \(d\)-dimensional polytopes as well. The method of attack has three parts: First, the problem is viewed through \(S_n\)-equivariant maps on the classical configuration spaces of \(n\) distinct labeled points in the plane. Second, such configuration of points are converted to partitions using ideas from Optimal Transport, in particular, that of a generalized Voronoi diagram. Finally, a beautiful \(S_n\)-equivariant cell complex is constructed, with \(n!\) vertices and \(n!\) facets, a generalization of the Salvetti complex. These three parts are brought together, and using equivariant obstruction theory, the result is proved.