#15422: factorization of non-squarefree polynomials over the p-adics
----------------------------------+--------------------------
Reporter: jdemeyer | Owner:
Type: defect | Status: needs_work
Priority: major | Milestone: sage-5.13
Component: padics | Resolution:
Keywords: | Merged in:
Authors: Jeroen Demeyer | Reviewers:
Report Upstream: N/A | Work issues:
Branch: | Commit:
Dependencies: #9640 | Stopgaps:
----------------------------------+--------------------------
Comment (by jdemeyer):
Replying to [comment:17 roed]:
> * rather than raising an `ArithmeticError` on line 159, we should use
gcds to return the square, with half the precision.
Why '''should''' we do that? My point of view is that we should warn
people that they do something which is not mathematically well-defined.
And as explained in the ticket description, `factor( (1+O(3^20))*t^2 )` is
not well-defined. One simply cannot determine whether it has `p`-adic
roots or not.
--
Ticket URL: <http://trac.sagemath.org/ticket/15422#comment:18>
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 http://groups.google.com/group/sage-trac.
For more options, visit https://groups.google.com/groups/opt_out.
