#11239: Incorrect coercion of polynomials over finite fields
-------------------------------------+-------------------------------------
Reporter: johanbosman | Owner: robertwb
Type: defect | Status: needs_review
Priority: major | Milestone: sage-6.2
Component: coercion | Resolution:
Keywords: finite fields, | Merged in:
polynomials, coercion, sd53 | Reviewers: Jean-Pierre Flori
Authors: Peter Bruin | Work issues:
Report Upstream: N/A | Commit:
Branch: | 07d774f5f0c226d866cf4ea519951f92268063ff
u/pbruin/11239-polynomial_coercion | Stopgaps:
Dependencies: #8335 |
-------------------------------------+-------------------------------------
Changes (by pbruin):
* status: needs_info => needs_review
* commit: 236effb6198c6192dce0cedc0e53423c68743e3e =>
07d774f5f0c226d866cf4ea519951f92268063ff
* branch: u/jpflori/ticket/11239 => u/pbruin/11239-polynomial_coercion
Comment:
Here is a fix based on the existing one and the "P.P.S" from comment:30.
This gets rid of the test for coercion maps in the polynomial constructor.
--
Ticket URL: <http://trac.sagemath.org/ticket/11239#comment:32>
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.
