Hi everyone,
I’m Tanishka Wagh, a third-year student studying Computational Mathematics (ECSOE) and Data Science & Programming (IIT Madras). I’ve worked on a course project involving Groebner bases and solving systems of polynomial equations, and I’m comfortable with Python, though still gaining experience with larger long-term codebases. I’ve been reading through the `sympy/polys` module and looking at the GSoC idea on efficient Groebner bases and their applications. From what I understand, the current implementation includes Buchberger, F5B and FGLM, while several directions (e.g. F4, sugar strategies, Groebner walk, etc.) are still open. I had two main questions: 1. The idea page <https://github.com/sympy/sympy/wiki/GSoC-Ideas#efficient-groebner-bases-and-their-applications> mentions previous related work, could someone point me to which past project(s) this refers to? 2. 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? I’m mainly interested in the Groebner/polys direction, but while exploring I also noticed the computational group theory roadmap in the combinatorics module. If one of these areas currently has clearer contribution opportunities or more active development, I’d really appreciate guidance. Thanks, Tanishka -- 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/01016f08-f580-4f7b-a8c7-bac512034eebn%40googlegroups.com.
