No label defined (Q4394973)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1163438
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1163438 |
Statements
2 March 2000
0 references
Eagon-Northcott formula
0 references
free resolutions of polynomial ideal
0 references
Gröbner basis
0 references
Buchberger's algorithm
0 references
0.8054414391517639
0 references
0.7968105673789978
0 references
0.789935827255249
0 references
0.7880695462226868
0 references
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].
0 references
