Skip to main content
5 events
when toggle format what by license comment
Jun 29 at 0:59 comment added mashedcarrots @RichardStanley Thank you for the response, Professor Stanley! I have looked into these order complexes. Do you have any insights on whether these are all vertex decomposable? Prof. Wachs mentions in these notes that there have not yet been parallel techiniques for vertex decomposability on order complexes. On the other hand, per this post, it seems like shellable but not vertex decomposable flag complexes are hard to come by?
Jun 28 at 0:33 comment added Richard Stanley There are a vast number of known partially ordered sets (posets) satisfying a combinatorial condition known as lexicographic shellability. The order complex of such a poset is shellable. For example, any finite upper semimodular lattice is lexicographically shellable. One entry into this subject is the paper by Björner and Wachs at jstor.org/stable/1999359
Jun 27 at 23:37 history edited mashedcarrots CC BY-SA 4.0
added 97 characters in body
Jun 27 at 22:17 history edited mashedcarrots CC BY-SA 4.0
added 115 characters in body
Jun 27 at 22:12 history asked mashedcarrots CC BY-SA 4.0