#7580: bugs in infinite polynomial ring
-----------------------+----------------------------------------------------
Reporter: was | Owner: SimonKing
Type: defect | Status: needs_work
Priority: major | Milestone: sage-4.3
Component: algebra | Keywords: infinite polynomial ring coercion
Work_issues: | Author: Simon King
Upstream: N/A | Reviewer:
Merged: |
-----------------------+----------------------------------------------------
Comment(by SimonKing):
In the patch 7580_follow_up.patch, which is to be applied after the first
patch, I do the following:
1. Replace the expected 32-bit hash value by the one that William
provided
2. Fix one bug in groebner_basis() -- I just found it by creating some
random ideals and computing the symmetric Gröbner basis. The problem was
that at some point it was not properly tested whether an element is a
unit. By consequence, the 0-ideal instead of the 1-ideal was returned.
3. Add this previously failing example as another doc test.
I keep it "needs work", until I get some advice what to do with the
inconsistent polynomial conversion. Perhaps one could just check that
{{{InfinitePolynomial(X,alpha_2) != alpha_2}}}? This would be the case on
both sage.math and your 32-bit Ubuntu. Acceptable solution?
Cheers,
Simon
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:17>
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.
