Hi Hasan! On Dec 16, 3:48 pm, Hasan Noori <nouri.ha...@gmail.com> wrote: > dear sage-devel, > i'm a master student of mathematic in filed of Groebner basis > i'm coding in maple, > and have many algorithm implementation around Groebner basis > such as FGLM,F4,univariate polynomial, Buchberger with criteria, > Basis of quotient ring K[x_1,...,x_n]/I,... > but i decided to coding in SAGE as Best choice for me (open Source) > can can every one help me?
Note that Martin Albrecht, Michael Brickenstein, Ludovic Perret and myself implemented F5 in Sage (in two ways, actually -- see http://wiki.sagemath.org/days10/CodingSprint ). However, the result is certainly not more than a toy implementation. Perhaps you can do better? Note also that there is libsingular in Sage, which provides various algorithms for Groebner basis computations, notably slimgb, which AFAIK is inspirated by F4. And IIRC there is also FGLM in Singular (I don't know if it is wrapped in libsingular). If your master's project is to implement FGLM and F4, then I think Sage, open source and with Cython and libsingular in the background, is a good framework. However, I would be surprised if the result were faster than Singular. Best regards, Simon -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org
