scientific article; zbMATH DE number 1163438
One of the basic applications of Gröbner bases theory is an algorithm for computing free resolutions of ideals (modules) over polynomial rings [see \textit{H. M. Moeller} and \textit{F. Mora}, J. Algebra 100, 138-178 (1986; Zbl 0621.13007)]. Since the well-known Eagon-Northcott theorem allows to describe a minimal free resolution of the ideal generated by the maximal minors of a matrix of indeterminates, it is quite natural to ask whether it is possible to get the Eagon-Northcott theorem from Gröbner bases theory. The results presented in the paper achieve this goal: The author shows how easy it is to construct a minimal free resolution of an ideal of maximal minors of a matrix from the developed theory of Gröbner bases, giving therefore a nice example of the flexibility of Buchberger's algorithm. For the entire collection see [Zbl 0883.00014].
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4394973)