#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:
|
------------------------------------------------------------------------------------------+
Changes (by SimonKing):
* work_issues: => Doctests for 32 bit; work around bug in
multipolynomial conversion (#7654)
Comment:
By doing some more random tests, I revealed another bug in the computation
of symmetric Gröbner bases.
Try
{{{
sage: X.<y,z> = InfinitePolynomialRing(GF(3),implementation='sparse')
sage: I = ['-y_9*z_8^2 + y_8*y_3*z_3 + y_5*z_8*z_2']*X
sage: I.groebner_basis(report=True)
}}}
In the report, you will soon get the impression that there is a loop.
Indeed there is, but that's easy enough to fix.
However, after fixing it, I was running into the bug in polynomial
conversion in libsingular that I reported at #7654.
Currently I try to find a work around. As a last resort, it might again be
conversion from strings...
I am collecting these in the "work issues" field.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/7580#comment:18>
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.
