Depth and regularity of monomial ideals via polarization and combinatorial optimization

Signed and weighted graphs (05C22) Combinatorial aspects of commutative algebra (05E40) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)

Abstract: In this paper we use polarization to study the behavior of the depth and regularity of a monomial ideal

I

, locally at a variable

x_{i}

, when we lower the degree of all the highest powers of the variable

x_{i}

occurring in the minimal generating set of

I

, and examine the depth and regularity of powers of edge ideals of clutters using combinatorial optimization techniques. If

I

is the edge ideal of an unmixed clutter with the max-flow min-cut property, we show that the powers of

I

have non-increasing depth and non-decreasing regularity. In particular edge ideals of unmixed bipartite graphs have non-decreasing regularity. We are able to show that the symbolic powers of the ideal of covers of the clique clutter of a strongly perfect graph have non-increasing depth. A similar result holds for the ideal of covers of a uniform ideal clutter.

Review text

Let \(R=K[x_{1},\dots,x_{n}]\) be a polynomial ring over a field \(K\). Let \(I\) be a monomial ideal of \(R\). The authors establish the depth and regularity formulas of \(R/I\) and \(R/(I,f)\) using the polarizations of \(I\) and \((I,f)\) where \(f\) is a monomial in \(R\) ( Proposition 2.11). They use this to study the behavior of the depth and regularity of \(R/I\), locally at a variable \(x_{i}\), when one lowers the degree of all the highest powers of the variable \(x_{i}\) occurring in the minimal generating set of \(I\). They show that the depth is locally non-decreasing at each variable \(x_{i}\) when lowering the top degree ( Theorem 3.1). They later examine the depth and regularity of powers and symbolic powers of edge ideals of clutters and graphs, and their ideals of covers. Let \(I(C)\) be the edge ideal of an unmixed clutter \(C\) with the max-flow min-cut property then the powers of \(I(C)\) have non-increasing depth and non-decreasing regularity (Theorem 4.9). Let \(G\) be a strongly perfect graph and let \(\text{cl}(G)\) be its clique clutter. If \(J\) is the ideal of covers of \(\text{cl}(G)\), then symbolic powers of \(J\) have non-increasing depth and non-decreasing regularity (Proposition 5.8).

Recommendations

Cites work

Cited in

(19)

Describes a project that uses

Uses Software

Macaulay2

This page was built for publication: Depth and regularity of monomial ideals via polarization and combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2000807)