Timeline for Computing homology of very large posets
Current License: CC BY-SA 2.5
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 14, 2015 at 14:41 | answer | added | Mateusz Juda | timeline score: 3 | |
| Oct 23, 2013 at 15:16 | answer | added | Michał Kukieła | timeline score: 2 | |
| Oct 22, 2010 at 21:13 | answer | added | j.p. | timeline score: 3 | |
| Oct 22, 2010 at 3:01 | comment | added | John Shareshian | If the whole poset is a lattice, have you considered the homotopy complementation formula of Bj\"orner and Walker? | |
| Oct 22, 2010 at 2:47 | comment | added | user10249 | Many thanks for all the responses. I borrowed Kozlov's book to read the chapter on spectral sequences, but somehow didn't look at the section on discrete Morse theory. I'll have to go back to the library! Also regarding the comment on recursive atom orderings, yes the upper intervals are in fact geometric lattices, so there is no problem with the recursive condition. It's the other one which is problematic. | |
| Oct 21, 2010 at 15:49 | answer | added | Priyavrat Deshpande | timeline score: 3 | |
| Oct 21, 2010 at 11:00 | answer | added | Jim Conant | timeline score: 9 | |
| Oct 21, 2010 at 9:43 | comment | added | Someone | I guess you know already that you don't have to check the recursive condition for a recursive atom ordering if the upper intervals $P_{\ge m}$ happen to be upper-semimodular lattices for all minimal elements $m$? | |
| Oct 21, 2010 at 2:25 | history | asked | Justin Koonin | CC BY-SA 2.5 |