#11239: Incorrect coercion of polynomials over finite fields
-------------------------------------------------+-------------------------
Reporter: johanbosman | Owner: robertwb
Type: defect | Status:
Priority: major | needs_work
Component: coercion | Milestone:
Keywords: finite fields, polynomials, | sage-5.11
coercion | Resolution:
Authors: pbruin | Merged in:
Report Upstream: N/A | Reviewers:
Branch: | Work issues:
Stopgaps: | Dependencies: #8335
-------------------------------------------------+-------------------------
Comment (by pbruin):
At this point there are two possible solutions:
- either fix the NTL polynomial constructor,
- or make the generic polynomial constructor coerce the coefficients if
necessary, and make the NTL polynomial constructor raise an error if it is
given a polynomial over a smaller finite field.
The first solution would be preferable in principle, but certainly harder
and maybe even unreasonable, since the NTL polynomial constructor is a
lower-level thing that should not have to care about maps between non-
trivial finite fields.
--
Ticket URL: <http://trac.sagemath.org/ticket/11239#comment:9>
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.
