Gröbner bases and primary decomposition of modules (Q1209627)

The results in this paper are a generalization to the case of modules of the results of \textit{P. Gianni}, \textit{B. Tragher}, and \textit{G. Zacharias}, ``Gröbner bases and primary decomposition of polynomial ideals'', J. Symb. Comput. 16, 149-167 (1993). In the first part of the paper it is analyzed the concept of Gröbner bases for modules over polynomial rings over a suitable ring \(R\) (in which it is assumed linear algebra can be performed). Successively, the paper contains the description of an algorithm which allows the computation of the primary decomposition of a module \(M\) given as a submodule of a free module over the ring of polynomials \(R[x_ 1,\dots,x_ n]\). In this part of the paper it is assumed that \(R\) is the ring of integers, the field of rationals or, more generally, any PID where linear algebra can be performed and, moreover, where there exists an algorithm for factoring polynomials over fields which are finitely generated over \(R\) or are residue fields of \(R\). As in the case of ideals it is first analyzed the case in which the module is zero-dimensional. A specific algorithm for this case is given. Successively, it is constructed the general algorithm which inductively (via localizations) uses the previous one.