#6941: GCD, XGCD for polynomial rings with templating
-----------------------+----------------------------------------------------
Reporter: spancratz | Owner: tbd
Type: defect | Status: new
Priority: minor | Milestone:
Component: algebra | Keywords:
Reviewer: | Author: Sebastian Pancratz
Merged: |
-----------------------+----------------------------------------------------
GCD and XGCD methods should return *monic* greatest common divisors.
However, at the moment these two methods in the template file
``sage/rings/polynomial/polynomial_template.pxi`` prevent this by
enforcing that ``gcd(a,0) == a`` and ``gcd(0,b) == b``.
I suggest that the code for these two methods in the template file should
only refer to the corresponding ``celement_foo`` methods of the actual
implementation. This way, all the logic is in the ``celement_foo``
methods, rather than being split between the two levels.
The patch for this should touch the template file as well as the two
linkage files for GF2X and zmod polynomials.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6941>
Sage <http://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
-~----------~----~----~----~------~----~------~--~---
