I actually tried taking linear combinations of the coefficients, to see if that would help, after reading the suggestion in a paper. But it turned out to be so much slower than not doing it, that I abandoned it. However, I didn't take the size of the coefficients into account, so I certainly wasn't doing exactly what you suggested. It could be worth a try.
Bill. On Saturday, 12 November 2016 19:22:12 UTC+1, parisse wrote: > > > > Le samedi 12 novembre 2016 08:16:41 UTC+1, Bill Hart a écrit : >> >> >> >> >> I wonder if it is sometimes worth taking the gcd G of the leading >> coefficients of the original primitive polynomials and then taking the gcd >> H of that with the leading coefficient L of the result of the psr process, >> and then trying L/H as the possible content. >> > > No idea, I don't think this will happen frequently. I would probably first > try to improve content computation by taking random combination of the > coefficients and the smallest one (numbers of monomials). > -- 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 post to this group, send email to sage-devel@googlegroups.com. Visit this group at https://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
