I may be interested in helping out with this but I am definitely not
knowledgeable enough on the math behind to tackle the task on my own.
S.
* John H Palmieri <jhpalmier...@gmail.com> [2019-11-13 18:36:25]:
Sage is not using very sophisticated methods for computing homology. If
anyone wants to implement something better, they are certainly welcome to.
I may try to look at the paper, but it may take me a while to get to it.
-- John
On Wednesday, November 13, 2019 at 4:48:18 PM UTC-8, Salvatore Stella wrote:
Dear All,
I was looking into computing homology of a certain chain complex when I
came
across this paper arXiv:1903.00783v1. Apparently he claims that he has an
algorithm to do so that is much faster than the one we currently have in
sage. Did I understand correctly the claim? If so, would it be worth to
port
his Mathematica code? Input from someone more knowledgeable than me on
(co)homology computations would be most welcome. Thanks
S.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/70f6386f-8a51-40e0-9660-9110a6665826%40googlegroups.com.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion on the web visit
https://groups.google.com/d/msgid/sage-devel/20191114110021.GA26934%40strabo.
