On 16-Dec-09, at 5:05 PM, William Stein wrote: > On Wed, Dec 16, 2009 at 2:04 PM, Jaap Spies <j.sp...@hccnet.nl> wrote: >> Hasan Noori 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? >>> >> >> Wecome! Yes, we all will be here to help you. >> >> One word of advise: if you want to be productive in Sage, learn >> to program in Python (referring to your questions in IRC). >> > > And if you want to write code that is blazingly fast, learn to program > in Cython as well.
These two replies are rather general; here's a more specific reply. You could start by looking at Martin Albrecht's toy implementation of Buchberger with/without criteria: sage.rings.polynomial.toy_buchberger. Martin might say more. Nick -- 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
