Lexicographic shellability conjecture for the uncrossing matching poset
Lexicographic shellability conjecture for the uncrossing matching poset
Let be the uncrossing partial order on matchings, and let denote its augmented poset. Lexicographic shellability conjecture. The poset is lexicographically shellable. The poset is known to be thin, and lexicographic shellability would provide a strong topological property consistent with the expectation that the associated spaces are homeomorphic to balls. The conjecture is presented as widely expected, but no resolution is given here.
Sources & referencesView supporting material
Primary source
Thomas Lam, “The uncrossing partial order on matchings is Eulerian”, arXiv:1406.5671 (2014).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.