On May 18, 3:11 am, Martin Albrecht <[email protected]> wrote:
> Hi, sorry for the late answer. > > Somebody is working on weighted term orderings, not sure if that's sufficient > for you: > > http://trac.sagemath.org/sage_trac/ticket/11316 > > Furthermore, I was hoping the passing-the-term-order-through-to-singular-if- > it-is-unknown feature would just work, however, it seems our parsing gets in > the way and throws an exception. However, it might be the case that the patch > at #11316 fixes this issue as well. > > Cheers, > Martin Martin, Thanks for getting back to me. It might be possible for me to use the weighted orderings - I'll have to think about it a little. I also thought I could use a matrix order, but when I try the following I don't get the answer I hoped to see: T = TermOrder('M(-1,0,0,-1)') R = PolynomialRing(GF(101), names = 'x, y', order = T) x, y = R.gens() print '1 > x ? ' + str(1 > x) Suppose I hack the __init__ in term_order.py so that I force self.__singular_str to be what I want. Would that solve my problem? And if the answer to that question is yes, then could a longer-term solution be to augment TermOrder objects so that a user can explicitly identify the underlying tool that the order is intended for? The parsing that's currently done in the __init__ seems difficult. No matter what, I am really grateful for the work that you and the rest of the Sage community have invested in this tool. A lot of my research has come out of what I've been able to write in Sage. Jeff Stroomer -- To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/sage-support URL: http://www.sagemath.org
