#17971: Infinite recursion when taking a resultant over a complicated base ring
-------------------------+-------------------------------------------------
Reporter: pbruin | Owner:
Type: defect | Status: new
Priority: major | Milestone: sage-6.6
Component: algebra | Keywords: infinite recursion polynomial
Merged in: | resultant
Reviewers: | Authors:
Work issues: | Report Upstream: N/A
Commit: | Branch:
Stopgaps: | Dependencies:
-------------------------+-------------------------------------------------
The following resultant computation leads to an infinite recursion:
{{{
sage: A.<a,c> = Frac(PolynomialRing(QQ,'a,c'))
sage: B.<d,e> = PolynomialRing(A,'d,e')
sage: R.<x> = PolynomialRing(B,'x')
sage: (a*d*x^2+a+e+1).resultant(-4*c^2*x+1)
Traceback (most recent call last):
...
RuntimeError: maximum recursion depth exceeded while calling a Python
object
}}}
(This is independent of #17817.)
--
Ticket URL: <http://trac.sagemath.org/ticket/17971>
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/d/optout.
