Depth and regularity of monomial ideals via polarization and combinatorial optimization

DOI10.1007/S40306-018-00308-ZzbMATH Open1427.13025arXiv1803.02017OpenAlexW2964116122MaRDI QIDQ2000807FDOQ2000807

José Martínez-Bernal, Susan Morey, Rafael H. Villarreal, Carlos E. Vivares

Publication date: 28 June 2019

Published in: Acta Mathematica Vietnamica (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1803.02017

zbMATH Keywords

regularityedge idealpolarizationdepthmonomial idealclutterMAX-flow MIN-cut

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Two-Triangle Case of the Acquaintance Graph
• Cohen-Macaulay graphs
• A characterization of triangle-free Gorenstein graphs and Cohen-Macaulayness of second powers of edge ideals
• Distributive lattices, bipartite graphs and Alexander duality
• Combinatorial characterizations of the Cohen-Macaulayness of the second power of edge ideals
• On the second powers of Stanley-Reisner ideals
• Cohen-Macaulayness of large powers of Stanley-Reisner ideals
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Monomial Ideals
• Stability of depths of powers of edge ideals
• The depth of powers of an ideal
• On the radical of a monomial ideal
• Depth and regularity of powers of sums of ideals
• Projective Reed-Muller codes
• The asymptotic nature of the analytic spread
• Edge ideals: algebraic and combinatorial properties
• On some invariants of a mixed product of ideals
• On bounds for some graph invariants
• Monomial Algebras
• Graded syzygies
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• Combinatorial optimization. Packing and covering
• Regularity and algebraic properties of certain lattice ideals
• Bounds on the regularity and projective dimension of ideals associated to graphs
• Minimum distance functions of graded ideals and Reed-Muller-type codes
• On the ideal theory of graphs
• The stable set of associated primes of the ideal of a graph
• Associated primes of powers of edge ideals
• Cohen-Macaulay Rees algebras and their specialization
• Cohen-Macaulayness for symbolic power ideals of edge ideals
• Embedded associated primes of powers of square-free monomial ideals
• Powers of Square-Free Monomial Ideals and Combinatorics
• Effective Cowsik–Nori Theorem for Edge Ideals
• A study of graded extremal rings and of monominal rings.
• Regularity of ideals and their radicals
• Blowup algebras of square-free monomial ideals and some links to combinatorial optimization problems
• Algebraic and combinatorial properties of ideals and algebras of uniform clutters of TDI systems
• A note on Rees algebras and the MFMC property
• Replication in critical graphs and the persistence of monomial ideals
• Stability of depths of symbolic powers of Stanley-Reisner ideals
• Equality of ordinary and symbolic powers of Stanley-Reisner ideals
• THE PROJECTIVE DIMENSION OF THE EDGE IDEAL OF A VERY WELL-COVERED GRAPH
• Cohen–Macaulayness and Limit Behavior of Depth for Powers of Cover Ideals
• A Beginner’s Guide to Edge and Cover Ideals
• Symbolic powers of ideals
• Some classes of strongly perfect graphs
• On the Cohen-Macaulay property in commutative algebra and simplicial topology
• The behavior of depth functions of cover ideals of unimodular hypergraphs
• Depth and Stanley depth of symbolic powers of cover ideals of graphs
• Regularity of powers of bipartite graphs
• Symbolic powers of cover ideal of very well-covered and bipartite graphs
• Depth and regularity modulo a principal ideal
• Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs
• Edge ideals of oriented graphs

Cited In (13)

• Polarization of Koszul cycles with applications to powers of edge ideals of whisker graphs
• Homological invariants of powers of fiber products
• Normality of cover ideals of graphs and normality under some operations
• Minimal depth of monomial ideals via associated radical ideals
• On regularity of symbolic Rees algebras and symbolic powers of vertex cover ideals of graphs
• Polarization and depolarization of monomial ideals with application to multi-state system reliability
• Regular sequences on squares of monomial ideals
• On the minimal free resolution of symbolic powers of cover ideals of graphs
• Integral closure of powers of edge ideals and their regularity
• Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs
• Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
• The facet ideals of chessboard complexes
• Symbolic powers of certain cover ideals of graphs

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)