#8558: add a fast gcd algorithm for univariate polynomials over absolute number
fields
-------------------------------------+-------------------------------------
Reporter: lftabera | Owner: AlexGhitza
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-6.4
Component: algebra | Resolution:
Keywords: gcd, pari, ntl, | Merged in:
number field |
Authors: Luis Felipe | Reviewers: Jeroen Demeyer
Tabera Alonso |
Report Upstream: N/A | Work issues:
Branch: | Commit:
u/lftabera/ticket/8558 | eef9fe12ac4578b08fbff4b8ca5264ad5e20a8b9
Dependencies: #14186, #15803, | Stopgaps:
#15804 |
-------------------------------------+-------------------------------------
Comment (by lftabera):
It it is not that, I only need basic arithmetic, at most, pari could be
interested in the discriminant, but I am working in QQ[I] in my examples.
Which should be easy.
I have tried to write polynomials in pure gp as
{{{f= Mod(3*y,y^2-1)*x^2+Mod(1,y^2-1)*x+Mod(y,y^2-1)}}}
or as
{{{
w=quadgen(-4)
f= 3*w*x^2+1*x+w
}}}
in both cases I get bad timing. Reading the documentation now to see how
to deal with polynomials with number field coefficients in pari...
--
Ticket URL: <https://trac.sagemath.org/ticket/8558#comment:58>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at https://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/d/optout.
