Algorithms in SINGULAR (Q1382072)

The author shows how to use SINGULAR to solve some problems of algebraic geometry. SINGULAR is a computer algebra system whose basic algorithms are variants of a general standard basis algorithm for general monomial orderings. There are several examples in the paper. Definitions of different monomial orderings in a polynomial ring in SINGULAR, computation of a standard basis, how to decide ideal (or module) membership, computation of the Hilbert function of a homogeneous ideal, how to solve equations by elimination, computation of the module of syzygies of a set of polynomials, etc. Finally, computations of \(\text{Ext} (M,R)\), \(\Hom_R (M,N)\) and \(T^1_X(M)\) (the module of first order deformations of \(X\) with values in \(M)\) are given.