#11890: Sage cannot factor polynomials over number fields with unfactorable
discriminant
-----------------------------+----------------------------------------------
Reporter: jdemeyer | Owner: davidloeffler
Type: enhancement | Status: needs_work
Priority: major | Milestone: sage-4.7.3
Component: number fields | Keywords: nffactor PARI nfinit pari_nf
Work_issues: | Upstream: N/A
Reviewer: | Author: Jeroen Demeyer
Merged: | Dependencies: #11891, #11130
-----------------------------+----------------------------------------------
Changes (by jdemeyer):
* status: needs_review => needs_work
Comment:
Replying to [comment:7 lftabera]:
> We need to figure out which method use, one option is the following:
>
> - If nfinit structure is already known, use (or try)
nfffactor(nfinit,f)
> - If nfinit is not computed, try nffactor
> - If the above fails, use factornf.
Agreed. Except that we really should do `nfinit()` if the discriminant is
easy.
> I am not yet sure what is the best way to proceed. I also feel that
there should be a way for allowing the user to override the algorithm to
use.
Why? If one algorithm is clearly better than another, why complicate
things with extra arguments?
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/11890#comment:8>
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 post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
