[sage-devel] Re: univariate polynomial gcd is slow forn number fields

2010-03-18 Thread luisfe
> sage: f1 = pari([i._pari_('y') for i in f.list()]).Pol() well, this is use Polrev() -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://grou

[sage-devel] Re: univariate polynomial gcd is slow forn number fields

2010-03-18 Thread luisfe
On 17 mar, 10:13, John Cremona wrote: > For an example of how polynomials over number fields are converted > into pari polynomials, see > sage/rings/polynomial/polynomial_element.pyx, in the factor function. > This is the code already used to factor polynomials over number fields > by converting

Re: [sage-devel] Re: univariate polynomial gcd is slow forn number fields

2010-03-17 Thread John Cremona
For an example of how polynomials over number fields are converted into pari polynomials, see sage/rings/polynomial/polynomial_element.pyx, in the factor function. This is the code already used to factor polynomials over number fields by converting to pari. It is more complicated than one would li

[sage-devel] Re: univariate polynomial gcd is slow forn number fields

2010-03-16 Thread luisfe
On 16 mar, 23:27, daveloeffler wrote: > Can you give an example where polynomials are being passed incorrectly > to Pari? There are some known bugs in Pari's own factorisation > routines (fixed in Pari 2.3.5, which should hopefully be in the next > Sage release), but if there are problems transl

[sage-devel] Re: univariate polynomial gcd is slow forn number fields

2010-03-16 Thread daveloeffler
On Mar 16, 8:29 pm, luisfe wrote: > The issue is that for univariates polynomials over absolute number > fields, the implementation is just the generic one using Euclidean > algorithm. I tried passing to pari but I am afraid that the pari > coertion for these polynomials is incorrect. Is this a