Great, just cc me on the ticket when you are able to get to it. I might be 
able to also take your toy implementation and port it over, but I likely 
won't have time until February.

Best,
Travis


On Thursday, November 28, 2019 at 1:38:33 AM UTC+10, Salvatore Stella wrote:
>
> Hi Travis (and all), 
> I already have a toy implementation and it is indeed worth including in 
> sage. 
> Given a chain complex it produces a new chain complex that has the same 
> homology but whose differentials are much much smaller. 
> You can look at it here: 
> https://github.com/Etn40ff/chromatic_symmetric_homology 
> I'll make a ticket about this as soon as we are done with the actual 
> writing 
> of our paper. 
> Best 
> S. 
>
>
> * Travis Scrimshaw <tsc...@ucdavis.edu <javascript:>> [2019-11-27 
> 07:32:59]: 
>
> >From the code provided in the paper, it doesn't look too indecipherable. 
> So 
> >a first step might just be doing a direct translation of that since 
> >understanding the math is not as necessary to do that. 
> > 
> >Best, 
> >Travis 
> > 
> > 
> >On Thursday, November 14, 2019 at 9:01:24 PM UTC+10, Salvatore Stella 
> wrote: 
> >> 
> >> 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 <jhpalm...@gmail.com <javascript:>> [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-...@googlegroups.com <javascript:>. 
> >> >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-...@googlegroups.com <javascript:>. 
> >To view this discussion on the web visit 
> https://groups.google.com/d/msgid/sage-devel/ae3b8722-d56c-4fda-8405-312dae5a38c4%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/9a539890-ee96-40f7-9f90-8204ac09d9b1%40googlegroups.com.

Reply via email to