
doi: 10.1007/bf02571229
Using methods from algebraic combinatorics, we prove that the set of \((r+1)\times (r+1)\)-minors of a generic \(m\times n\)-matrix forms a reduced Gröbner basis (for certain term orders). This yields an efficient normal form algorithm and an explicit Stanley decomposition for the coordinate ring of matrices with rank \(\leq r\).
normal form algorithm, Stanley decomposition for the coordinate ring, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Symbolic computation and algebraic computation, Determinantal varieties, Article, Polynomial rings and ideals; rings of integer-valued polynomials, 510.mathematics, determinantal ideals, Linkage, complete intersections and determinantal ideals, reduced Gröbner basis
normal form algorithm, Stanley decomposition for the coordinate ring, Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases), Symbolic computation and algebraic computation, Determinantal varieties, Article, Polynomial rings and ideals; rings of integer-valued polynomials, 510.mathematics, determinantal ideals, Linkage, complete intersections and determinantal ideals, reduced Gröbner basis
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 64 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 1% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
