Building planar polygon spaces from the projective braid arrangement
The moduli space of planar polygons with generic side lengths is a smooth, closed manifold. It is known that these manifolds contain the real points of the moduli space of distinct points on the projective line as an open dense subset. Hence, such a polygon space is a compactification of this real moduli space. Kapranov showed that the real points of the Deligne-Mumford-Knudson compactification can be obtained from the projective Coxeter complex of type $A$ (equivalently, the projective braid arrangement) by iteratively blowing up along the minimal building set. In this paper we show that these planar polygon spaces can also be obtained from the projective Coxeter complex of type $A$ by performing an iterative cellular surgery along a sub-collection of the minimal building set. Interestingly, this sub-collection is determined by the combinatorial data associated with the length vector called the genetic code.