I guess I was trying to say that it would be nice if that could be
done more easily, like if one could do
sage: var('x,y,z')
sage: fs = [x^2*y - y, sin(z)*x*y^2 - y*sin(z)]
sage: SR.groebner_basis(fs, [x,y])
-Marshall
On Jul 22, 3:47 am, Martin Albrecht
wrote:
> On Tuesday 21 July 2009, Mars
On Tuesday 21 July 2009, Marshall Hampton wrote:
> I would recommend looking at how Mathematica handles this sort of
> thing. One of the things I miss is its ability to selectively treat
> different variables as either part of a coefficient ring or as
> multivariate polynomials. For example:
> G
I would recommend looking at how Mathematica handles this sort of
thing. One of the things I miss is its ability to selectively treat
different variables as either part of a coefficient ring or as
multivariate polynomials. For example:
GroebnerBasis[{x^2*y - y, Sin[z]*x*y^2 - y*Sin[z]}, {x, y}]
On Tue, Jul 21, 2009 at 9:44 AM, William Stein wrote:
> On Tue, Jul 21, 2009 at 9:37 AM, Ryan Hinton wrote:
>>
>> Are Groebner bases for multivariate polynomials over the symbolic ring
>> supposed to work?
>
> No, they are definitely not supposed to work.
I take that back. The toy implementation
OK, this is now #6581. I assume it's just the
MPolynomialRing_polydict class missing the monomial_divides method.
Can anybody recommend a good approach for this?
Thanks!
- Ryan
On Jul 21, 12:44 pm, William Stein wrote:
> On Tue, Jul 21, 2009 at 9:37 AM, Ryan Hinton wrote:
>
> > Are Groebner b
On Tue, Jul 21, 2009 at 9:37 AM, Ryan Hinton wrote:
>
> Are Groebner bases for multivariate polynomials over the symbolic ring
> supposed to work?
No, they are definitely not supposed to work.
William
> Here's what I get in Sage 4.0.1.rc2:
>
> sage: R2. = SR[]
> sage: I2 = [a*b+a, a*a] * R2
> s