The uncrossing partial order on matchings is Eulerian
Combinatorics
2014-06-24 v1
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.
Cite
@article{arxiv.1406.5671,
title = {The uncrossing partial order on matchings is Eulerian},
author = {Thomas Lam},
journal= {arXiv preprint arXiv:1406.5671},
year = {2014}
}
Comments
6 pages