#7097: bug in polynomial factorization over number fields
---------------------+------------------------------------------------------
Reporter: cremona | Owner: tbd
Type: defect | Status: new
Priority: major | Milestone: sage-4.1.3
Component: algebra | Keywords: polynomial factor root number field
Reviewer: | Author:
Merged: |
---------------------+------------------------------------------------------
Comment(by was):
{{{
John Cremona responds:
> I'm sure that is what pari already does -- you have to avoid some
> special cases, where the norm is not square free. That is the case
> here, so the avoidance is not working.
*Why* are you sure that this is what PARI already does?
The relevant paper is:
http://www.math.fsu.edu/~hoeij/papers/factor_Oct12_2004.dvi
Note that this paper contains statements like: "Then one has a polynomial
time
algorithm that runs very well in practice, with running times that should
be
the same as those reported in [Bel03] for QQ[X]." Such a statement would
perhaps be silly if one just reduces to the QQ case by taking norms.
I'm not 100% sure of anything though since I haven't read the relevant
pari
source code yet.
William
}}}
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7097#comment:4>
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
-~----------~----~----~----~------~----~------~--~---
