The uncrossing partial order on matchings is Eulerian

2014/06/22 by Thomas Lam, Lam, Thomas
Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.1406.5671

6 pages

arxiv created 2014/06/22 · arxiv updated 2014/06/24

Abstract

We prove that the partial order on the set of matchings of 2n points on a circle, given by resolving crossings, is an Eulerian poset.

Related

• Subdivisions of lower Eulerian posets
• Flag vectors of Eulerian partially ordered sets
• Some properties of a new partial order on Dyck paths
• An order on circular permutations
• Pattern avoidance in the matching pattern poset