On 2019-02-08, Daniel Krenn wrote:
> Which algorithm does not return a *reduced* Gröbner basis?
Singular has some options that determine whether or not a reduced GB is
returned. I simply don't know (and have at the moment no time to look at
the code) whether this option is used. Also, IIRC,
On 2019-02-08 10:33, Simon King wrote:
> On 2019-02-08, Daniel Krenn wrote:
>> Let I be an ideal. Then I might want to compute something involving
>> Groebner basis, e.g. computing I.variety().
>> Now suppose one wants to select a particular algorithm for the
>> computation of the Groebner basis.
Hi Daniel,
On 2019-02-08, Daniel Krenn wrote:
> Let I be an ideal. Then I might want to compute something involving
> Groebner basis, e.g. computing I.variety().
> Now suppose one wants to select a particular algorithm for the
> computation of the Groebner basis. Then (due to caching) I use
Let I be an ideal. Then I might want to compute something involving
Groebner basis, e.g. computing I.variety().
Now suppose one wants to select a particular algorithm for the
computation of the Groebner basis. Then (due to caching) I use something
along the lines of
GB =