[21:30] <wstein-1649> one thing about #1940...
[21:30] <wstein-1649> If you're comparing two ideals, it might make sense to use the term ordering for which
[21:30] <wstein-1649> computing groebner basis is *easy*.
[21:31] <wstein-1649> E.g., wrt one order it can be super super hard, and wrt to another, quite easy.
[21:31] <mabshoff> Yep. That sounds like a great idea.
[21:31] <mabshoff> i.e. degrevlex per default.
[21:31] <mabshoff> Ticket?
[21:31] <wstein-1649> But in malb's code for #1940 he just uses whatever term order.
[21:31] <mabshoff> Well, I think he caches the gbasis, so in some cases it might already exist.
[21:32] <wstein-1649> Also, he doesn't even seem to check that other is an ideal.
[21:32] <wstein-1649> Also, if the two ideals are in the same ring but with two different term orders,
[21:32] <wstein-1649> that __cmp__ function will get the wrong answer.
[21:32] <mabshoff> mmh.
[21:32] <mabshoff> I guess reopen, but leave the patch applied?
[21:32] <wstein-1649> I think his patch perfectly addresses the given #1940.
[21:32] <wstein-1649> But there should be another trac ticket about my points above.
[21:33] <wstein-1649> Yeah?
[21:33] <mabshoff> Yep.
[21:33] <wstein-1649> Can you open it and maybe paste this discussion in?
[21:33] <mabshoff> Already on the way :)
[21:33] <wstein-1649> cool.