A Conway-Coxeter theorem for decorated frieze patterns

Source abstract

Let $m\geq0$ and put $n=m+3$. We introduce a normalized positive Laurent class of decorated frieze patterns and prove a decorated analogue of the Conway-Coxeter classification theorem. Namely, such friezes of width $m$ are in canonical bijection with weighted triangulations of a convex $n$-gon, whose boundary edges are labeled by independent variables $y_1,\ldots,y_n$ and whose diagonals are labeled by $x_1,\ldots,x_m$. While a weighted Conway-Coxeter propagation algorithm constructs the frieze from a weighted triangulation, a main new ingredient is an explicit nonrecursive Laurent formula expressing each quiddity entry directly from the weighted triangles incident to the corresponding vertex. Conversely, specialization to $1$, Laurent positivity, and a decorated cutting-and-gluing procedure recover the weighted triangulation from the frieze.