Re: [sage-support] add sage-coding-the...@googlegroups.com ?

2019-01-22 Thread Dima Pasechnik
David, just do a pull request to https://github.com/sagemath/website On Tue, Jan 22, 2019 at 10:10 PM David Joyner wrote: > > Hi: > > Can someone with access to the website please add > sage-coding-the...@googlegroups.com > to http://www.sagemath.org/development-groups.html? > > Thanks! > David

[sage-support] add sage-coding-the...@googlegroups.com ?

2019-01-22 Thread David Joyner
Hi: Can someone with access to the website please add sage-coding-the...@googlegroups.com to http://www.sagemath.org/development-groups.html? Thanks! David Joyner -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group

[sage-support] Re: Loading heavy computations

2019-01-22 Thread Nils Bruin
See: https://trac.sagemath.org/ticket/27091 Balanced summing (which you are basically doing) already makes a bit of a difference. If that's indeed the issue then using a balanced summing strategy already gives a better order on the algorithm. -- You received this message because you are

[sage-support] Re: Loading heavy computations

2019-01-22 Thread Nils Bruin
Thank you for such a detailed description. I think this is a good basis for an enhancement ticket. I don't think there is a fundamental reason why polynomial construction from a dictionary shouldn't do something efficient itself already. As an example of the kind of code we can benchmark on:

Re: [sage-support] algorithme

2019-01-22 Thread henri girard
two other books (tutorial) in english about sage very good :) http://www.people.vcu.edu/~clarson/bard-sage-for-undergraduates-2014.pdf http://www.math.usm.edu/dont_panic/draft12.pdf Le 22/01/2019 à 09:49, Emmanuel Charpentier a écrit : s/recommandé/recommander Le mardi 22 janvier 2019

[sage-support] Re: Loading heavy computations

2019-01-22 Thread Enrique Artal
The answer is very helpful. I saw a way to solve the specific problem using other techniques but I tried to see anyway how to recover the computation. The key of the problem was a polynomial with more that 16 millions of monomials. I made the following approaches: 1. Save the object in a

Re: [sage-support] algorithme

2019-01-22 Thread Emmanuel Charpentier
s/recommandé/recommander Le mardi 22 janvier 2019 09:47:21 UTC+1, Emmanuel Charpentier a écrit : > > Le dimanche 20 janvier 2019 02:23:14 UTC+1, Anton Sherwood a écrit : >> >> On 2019-1-19 15:52, MAMANE DJAMILOU Salissou Dango wrote: >> > Bonjour, >> > je suis un tous nouveau utilisateur de

Re: [sage-support] algorithme

2019-01-22 Thread Emmanuel Charpentier
Le dimanche 20 janvier 2019 02:23:14 UTC+1, Anton Sherwood a écrit : > > On 2019-1-19 15:52, MAMANE DJAMILOU Salissou Dango wrote: > > Bonjour, > > je suis un tous nouveau utilisateur de sagemath. Je maîtrise les > > opérations indépendantes. Mon souci se trouve au nivaux des algorithmes. > >