The uncrossing partial order on matchings is Eulerian

DOI10.1016/j.jcta.2015.04.004zbMath1319.05106arXiv1406.5671OpenAlexW242316967MaRDI QIDQ491966

Thomas Lam

Publication date: 19 August 2015

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.5671

zbMATH Keywords

matchingsEulerian posetuncrossing partial order

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (11)

Positroid stratification of orthogonal Grassmannian and ABJM amplitudes ⋮ Proof of a conjecture of Kenyon and Wilson on semicontiguous minors ⋮ The Space of Circular Planar Electrical Networks ⋮ Polymatroids, closure operators and lattices ⋮ On the geometry of the orthogonal momentum amplituhedron ⋮ The cd-indices of intervals in the uncrossing partial order on matchings ⋮ Shellability of face posets of electrical networks and the CW poset property ⋮ Electroid varieties and a compactification of the space of electrical networks ⋮ The totally nonnegative Grassmannian is a ball ⋮ The totally nonnegative Grassmannian is a ball ⋮ Ising model and the positive orthogonal Grassmannian

Cites Work

• Positroid stratification of orthogonal Grassmannian and ABJM amplitudes
• Circular planar electrical networks: posets and positivity
• The positive orthogonal Grassmannian and loop amplitudes of ABJM
• Combinatorics of Coxeter Groups
• The Laplacian on planar graphs and graphs on surfaces
• Möbius inversion for the Bruhat ordering on a Weyl group

This page was built for publication: The uncrossing partial order on matchings is Eulerian