1999
DOI: 10.1090/s0002-9939-99-04535-9
|View full text |Cite
|
Sign up to set email alerts
|

The Dedekind-Mertens formula and determinantal rings

Abstract: Abstract. We give a combinatorial proof of the Dedekind-Mertens formula by computing the initial ideal of the content ideal of the product of two generic polynomials. As a side effect we obtain a complete classification of the rank 1 Cohen-Macaulay modules over the determinantal rings K[X]/I 2 (X).Let f, g be polynomials in one indeterminate over a commutative ring A. The Dedekind-Mertens formula relates the content ideals of f , g, and their product f g: one has . The main objective of this paper is a combina… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
7
0

Year Published

2000
2000
2021
2021

Publication Types

Select...
8

Relationship

1
7

Authors

Journals

citations
Cited by 20 publications
(7 citation statements)
references
References 13 publications
0
7
0
Order By: Relevance
“…. , y m ); using a variety of techniques including determinantal ideals, residual intersections and Gröbner basis, [15] and [6] describe additional features of this and other related subideals in connection with the so-called Dedekind-Mertens Lemma. A hook-shaped tableau is the other extremal case; in this situation I λ = x 1 (y 1 , .…”
Section: Betti Numbers and Primary Decompositions Of Ferrers Idealsmentioning
confidence: 99%
“…. , y m ); using a variety of techniques including determinantal ideals, residual intersections and Gröbner basis, [15] and [6] describe additional features of this and other related subideals in connection with the so-called Dedekind-Mertens Lemma. A hook-shaped tableau is the other extremal case; in this situation I λ = x 1 (y 1 , .…”
Section: Betti Numbers and Primary Decompositions Of Ferrers Idealsmentioning
confidence: 99%
“…. , m) ∈ Z n , the ideal I λ is the edge ideal of a complete bipartite graph, and a distinguished minimal reduction of I λ is given by the Dedekind-Mertens content formula (see [54,15,5]). Here we extend this result to arbitrary Ferrers ideals.…”
Section: Minimal Reductionsmentioning
confidence: 99%
“…That is, c(f g) is a minimal reduction of c(f ) • c(g) with reduction number min{n, m} − 1 (see Figure 1). Subsequently, a combinatorial proof of the Dedekind-Mertens formula was given by Bruns and Guerrieri [5] via a study of the Gröbner basis of the ideal c(f g). The boxes in Figure 1 are naturally associated…”
Section: Introductionmentioning
confidence: 99%
“…Proof. Let R be the ring k[X]/I 2 (X) and d be the Krull dimension of R. It is well-known; see, for example, [7,Cor. 4], [12, Cor.1], [23], or [1], that…”
Section: The Valuementioning
confidence: 99%