Depth and regularity of monomial ideals via polarization and combinatorial optimization

Combinatorial aspects of commutative algebra (05E40) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Signed and weighted graphs (05C22) 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.

Recommendations

Cites work

Cited in

(16)

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)