On Mon, 23 Feb 2026 at 09:48, Tanishka Wagh <[email protected]> wrote: > > Hi everyone,
Hi Tanishka, > I had two main questions: > > The idea page mentions previous related work, could someone point me to which > past project(s) this refers to? I'm not sure which projects it refers to. Probably looking at git blame will lead you to the past pull requests and issues. > I noticed that a lot of current work in `polys` seems focused on type > annotations and infrastructure improvements. How does Groebner-basis work fit > into current priorities, and are there particular entry points that would be > helpful to start with? Improving Groebner basis is definitely a worthwhile project. In particular I think implementing the F4 algorithm would be good. There is already some code for sparse RREF (with division and also fraction-free) with DomainMatrix that could be used as a starting point. Another thing that would be very useful is having interfaces that can efficiently store a Groebner basis and compute a new basis for the initial basis plus one extra polynomial sort of like this: In [6]: gb = groebner([x**2 - 2, y**2 - x], [x, y]) In [7]: gb2 = groebner(list(gb) + [z*x - y], [z, x, y]) Computing gb2 from gb is what is needed to implement exact division in a polynomial ring modulo a system of polynomial equations which is a primitive operation for fraction-free algebra over such rings. It can be done much more efficiently than computing a Groebner basis fully from scratch each time but an interface/implementation for that is needed. -- Oscar -- 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 view this discussion visit https://groups.google.com/d/msgid/sympy/CAHVvXxTEPomebdT7ecvRnb-d%2BoRHmEQ_%3D7nK0Mb8Jq7zO%2Bdc0A%40mail.gmail.com.
