Convex Equipartitions via Equivariant Obstruction Theory

2012/02/24 by Blagojević, Pavle V. M., Ziegler, Günter M. · 2 citations
#52A37 #55S91 #Algebraic Topology (math.AT) #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG)

paper · doi:10.48550/arxiv.1202.5504

Abstract

We describe a regular cell complex model for the configuration space F(\R^d,n). Based on this, we use Equivariant Obstruction Theory to prove the prime power case of the conjecture by Nandakumar and Ramana Rao that every polygon can be partitioned into n convex parts of equal area and perimeter.

Cited by

• Revisiting the Nandakumar-Ramana Rao Conjecture
• On the complexity of parametrized motion planning algorithms

Related

• Convex Equipartitions inspired by the little cubes operad
• Equipartition of several measures
• Convex fair partitions into an arbitrary number of pieces
• Convex Equipartitions of volume and surface area
• A Set of Questions in Combinatorial and Metric Geometry