Timeline for Computer-aided homology computations
Current License: CC BY-SA 3.0
6 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Sep 16, 2012 at 19:34 | comment | added | Anthony Bak | Dionysus also has python bindings. | |
Sep 15, 2012 at 6:20 | comment | added | Mikael Vejdemo-Johansson | I know Dionysus can deal with several million, not sure where the upper limit resides. In particular, the upper limit probably depends a lot on what size computer you have access. | |
Sep 12, 2012 at 17:15 | comment | added | Ryan Budney | Can Dionysus handle 15 million dimensional chain complexes? | |
Sep 12, 2012 at 13:00 | comment | added | David E Speyer | Since the example in question comes from the cohomology of a moduli space, I suspect that $H^{\ast}(X, \mathbb{Z})$ does not have a lot of torsion. By computing cohomology with $\mathbb{Z}/p$ coefficients for several different large $p$, and staring at the universal coefficient theorem, you might be able to make an intelligent guess as to what the torsion free part of $H^{\ast}(X, \mathbb{Z})$ is. | |
Sep 12, 2012 at 11:08 | comment | added | Steve Huntsman | I would add that the case of $\mathbb{Z}/2\mathbb{Z}$ in particular is most convenient computationally, and is covered in great detail in Edelsbrunner and Harer or Zomorodian. | |
Sep 12, 2012 at 9:22 | history | answered | Mikael Vejdemo-Johansson | CC BY-SA 3.0 |