Two Wilson loop diagrams define the same positroid exactly when they differ by retriangulating certain exact subdiagrams, and inequivalent diagrams correspond to non-parallel faces of an associahedron.
Polygon dissections and Euler, Fuss, Kirkman and Cayley numbers
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We give a short proof for a formula for the number of divisions of a convex (sn+2)-gon along non-crossing diagonals into (sj+2)-gons, where 1<=j<=n-1. In other words, we consider dissections of an (sn+2)-gon into pieces which can be further subdivided into (s+2)-gons. This formula generalizes the formulas for classical numbers of polygon dissections: Euler-Catalan number, Fuss number and Kirkman-Cayley number. Our proof is elementary and does not use the method of generating functions.
citation-role summary
background 1
citation-polarity summary
fields
math-ph 1years
2019 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Combinatorics of the geometry of Wilson loop diagrams I: equivalence classes via matroids and polytopes
Two Wilson loop diagrams define the same positroid exactly when they differ by retriangulating certain exact subdiagrams, and inequivalent diagrams correspond to non-parallel faces of an associahedron.