[sage-devel] Re: Groebner bases over symbolic ring

2009-08-15 Thread Bjarke Hammersholt Roune
> > If I have understood this correctly, and the suggestion is to use > > Buchberger's algorithm to compute Grobner bases in Sage's symbolic > > ring, which includes limited precision floating point numbers > > This is not what William meant (well, I think :). You can compute in the > symbolic rin

[sage-devel] Re: Groebner bases over symbolic ring

2009-08-12 Thread Michael Brickenstein
Hmm, poles are not so bad. We can imagine, that you do something like with rational functions: define two expressions are equal, if they are equal on some open and dense subset. If you have something like sin[x] and cos[x-Pi/2] you should add a relation, that they are equal. And I suppose, there

[sage-devel] Re: Groebner bases over symbolic ring

2009-08-12 Thread Martin Albrecht
> > I think one should treat it like a field for this purpose. It is of > > course not really > > a field, since functions have poles, etc.; also, their are floating > > point numbers in > > SR and floating point numbers don't form a field either. But they are > > supposed to approximately mode

[sage-devel] Re: Groebner bases over symbolic ring

2009-08-12 Thread Michael Brickenstein
We strongly recommend to use exact types for Groebner bases computations in Singular. Michael --~--~-~--~~~---~--~~ To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel-unsubscr...@googlegro

[sage-devel] Re: Groebner bases over symbolic ring

2009-08-12 Thread Bjarke Hammersholt Roune
On Jul 22, 7:20 pm, William Stein wrote: > Albrecht wrote: > > Not, sure it is enough to add this though. Since it isn't clear what the the > > symbolic ring is exactly, i.e. is it a field, I don't know which definition > > of > > a GB applies. > > I think one should treat it like a field for th

[sage-devel] Re: Groebner bases over symbolic ring

2009-07-22 Thread William Stein
On Wed, Jul 22, 2009 at 1:38 AM, Martin Albrecht wrote: > > On Tuesday 21 July 2009, Ryan Hinton wrote: >> 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? > > Hi, take a  look a

[sage-devel] Re: Groebner bases over symbolic ring

2009-07-22 Thread Martin Albrecht
On Tuesday 21 July 2009, Ryan Hinton wrote: > 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? Hi, take a look at the generic monomial_divides function in multi_polynomial_ri

[sage-devel] Re: Groebner bases over symbolic ring

2009-07-21 Thread Ryan Hinton
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