Timeline for Testing simplicial complexes for shellability
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 12, 2019 at 16:25 | comment | added | Russ Woodroofe | Yes, those are tricky. Indeed, the NP-completeness proof for shellability puts such complexes to good use. It's also worth mentioning that the above idea is unlikely to be helpful with a complex that is sequentially Cohen-Macaulay, but not shellable. Still, I've found this approach helpful for checking conjectures (and it's easy to implement). | |
| May 10, 2019 at 22:16 | comment | added | Richard Stanley | Note however (mathoverflow.net/questions/257792) that there are simplicial complexes with more than one facet such that one of the facets must come last in any shelling. Probably most partial shellings cannot be completed to a shelling. | |
| Apr 24, 2013 at 1:00 | history | answered | Russ Woodroofe | CC BY-SA 3.0 |