Hi All, I've been using the polynomials module in SymPy, and it's great stuff. I noticed that your implementation of Buchberger's algorithm uses the normal selection strategy for choosing which pair to look at next. I was wondering if there would be any interest in a pull request that implements the "sugar" strategy outlined in Giovini & Mora (http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.7.1065)? I think it's supposed to be a little better when computing with lex orderings.
Also, does the SymPy community have a benchmark for efficiency of the groebner() implementations? If not, and if there's interest in one, I'd be happy to help with that too. Thanks! Will -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/b37d3295-1f0a-42bc-adc1-bc9e66034c52%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
