Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
From MaRDI portal
(Redirected from Publication:5496298)
Planar graphs; geometric and topological aspects of graph theory (05C10) Hypergraphs (05C65) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Combinatorial aspects of simplicial complexes (05E45) Syzygies, resolutions, complexes and commutative rings (13D02)
Abstract: We introduce the concept of edgewise domination in clutters, and use it to provide an upper bound for the projective dimension of any squarefree monomial ideal. We then use a simple recursion to recover a formula for the projective dimension of a monomial ideal associated to a chordal clutter, as defined by Woodroofe in cite{russ}. We also study a family of clutters associated to graphs, and show that these clutters are chordal if and only if the associated graph is. Finally, we compute domination parameters for certain classes of these clutters.
Recommendations
- Further applications of clutter domination parameters to projective dimension
- Regularity and projective dimension of edge ideals
- Projective dimension, graph domination parameters, and independence complex homology
- Castelnuovo-Mumford regularity and projective dimension of a squarefree monomial ideal
- Bounds on the regularity and projective dimension of ideals associated to graphs
Cites work
- M-sequences, graph ideals, and ladder ideals of linear type
- A tree version of Kőnig's theorem
- Algebraic properties of edge ideals via combinatorial topology
- Algebraic properties of the path ideal of a tree
- Bounds on the regularity and projective dimension of ideals associated to graphs
- Chordal and sequentially Cohen-Macaulay clutters
- Depths and Cohen-Macaulay properties of path ideals
- Extremal problems for transversals in graphs with bounded degree
- Graded Betti numbers of path ideals of cycles and lines
- HYPERGRAPHS AND REGULARITY OF SQUARE-FREE MONOMIAL IDEALS
- Local cohomology and pure morphisms
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- On rigid circuit graphs
- Path ideals of rooted trees and their graded Betti numbers
- Projective dimension, graph domination parameters, and independence complex homology
- Über lokale Kohomologiegruppen hoher Ordnung.
Cited in
(13)- Upper bounds for the regularity of gap-free graphs in terms of minimal triangulation
- Breaking up simplicial homology and subadditivity of syzygies
- Initially regular sequences and depths of ideals
- Polarization and depolarization of monomial ideals with application to multi-state system reliability
- Domination numbers and noncover complexes of hypergraphs
- Further applications of clutter domination parameters to projective dimension
- Projective dimension of string and cycle hypergraphs
- Regularity and projective dimension of edge ideals
- ON THE DEPTH OF SYMBOLIC POWERS OF EDGE IDEALS OF GRAPHS
- Depth of powers of squarefree monomial ideals (research)
- Edge ideals of clique clutters of comparability graphs and the normality of monomial ideals
- Lower bounds for the depth of symbolic powers of edge ideals of graphs
- Bounds on the Stanley depth and Stanley regularity of edge ideals of clutters
This page was built for publication: Bounding the projective dimension of a squarefree monomial ideal via domination in clutters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5496298)
