Timeline for Trees in chain complexes
Current License: CC BY-SA 4.0
10 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Oct 12, 2020 at 21:27 | history | edited | Tim Campion | CC BY-SA 4.0 |
added 1053 characters in body
|
Oct 12, 2020 at 21:05 | comment | added | Tim Campion | @SurojitGhosh Not sure if you were talking to me, and not sure I understood the question correctly, but I added an edit inspired by your comment. | |
Oct 12, 2020 at 21:04 | history | edited | Tim Campion | CC BY-SA 4.0 |
added 1733 characters in body
|
Oct 12, 2020 at 20:07 | vote | accept | Surojit Ghosh | ||
Oct 12, 2020 at 20:08 | |||||
Oct 12, 2020 at 20:00 | comment | added | Surojit Ghosh | @DmitriPavlov: Thank you so much, Dmitri. Do you think that the classification of the diagram of the form $A\langle n \rangle_\ast \stackrel{f}{\to} B\langle n \rangle_\ast \stackrel{g}{\to} C \langle n \rangle_\ast$ with $g\circ f \sim 0$, can be recovered form the $ho(Ch_\mathbb{Q})$ and the classification of the diagram of the type $E\langle n \rangle_\ast \to 0 \to \Sigma E\langle n \rangle_\ast$? Here $A\langle n \rangle_\ast$ is the chain complex concentrated in degree $n$ and $A\langle n \rangle_n=A.$ | |
Oct 12, 2020 at 19:46 | history | edited | Tim Campion | CC BY-SA 4.0 |
added 82 characters in body
|
Oct 12, 2020 at 19:34 | comment | added | Tim Campion | @DmitriPavlov Fixed, thanks! | |
Oct 12, 2020 at 19:34 | history | edited | Tim Campion | CC BY-SA 4.0 |
deleted 3 characters in body
|
Oct 12, 2020 at 19:33 | comment | added | Dmitri Pavlov | Did you mean Fun(T,Ch_k) as opposed to Fun(Ch_k,T)? | |
Oct 12, 2020 at 19:32 | history | answered | Tim Campion | CC BY-SA 4.0 |