#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: Doctests for 32 bit; work around bug in multipolynomial
conversion (#7654) | Author: Simon King
Upstream: N/A
| Reviewer:
Merged:
|
------------------------------------------------------------------------------------------+
Comment(by SimonKing):
For your information
I am currently doing random tests: Chose a random polynomial and compute
the symmetric Gröbner basis. Do so both in the dense and the sparse
implementation. Compare the results.
Running 50 such examples, I found the libsingular bug reported at #7654,
and I have another example in which I don't know yet what goes wrong.
Dunno if it is my fault or what else.
Anyway. I hope that next week I can provide a patch that is ready for
review.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:19>
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.
