Minimal free resolution of monomial ideals by iterated mapping cone

DOI10.1007/s41980-018-0066-1zbMath1452.13016arXiv1708.08370OpenAlexW2964002196MaRDI QIDQ1734098

Leila Sharifan

Publication date: 22 March 2019

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

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

zbMATH Keywords

regularityindependence numbermapping coneedge ideal of a hypergraphmax-path ideal

Mathematics Subject Classification ID

Hypergraphs (05C65) Syzygies, resolutions, complexes and commutative rings (13D02) Combinatorial aspects of commutative algebra (05E40)

Related Items (4)

Closed neighborhood ideal of a graph ⋮ Subadditivity, strand connectivity and multigraded Betti numbers of monomial ideals ⋮ CONSECUTIVE CANCELLATIONS IN FILTERED FREE RESOLUTIONS ⋮ From grids to pseudo-grids of lines: Resolution and seminormality

Cites Work

• Matchings, coverings, and Castelnuovo-Mumford regularity
• Path ideals of rooted trees and their graded Betti numbers
• \(M\)-sequences, graph ideals, and ladder ideals of linear type
• Resolutions by mapping cones
• Simplicial trees are sequentially Cohen-Macaulay
• Resolutions obtained by iterated mapping cones
• Ideals containing the squares of the variables
• Componentwise linear ideals
• Monomial ideals whose powers have a linear resolution
• Monomial Ideals
• Minimal path cover sets and monomial ideals
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal free resolution of monomial ideals by iterated mapping cone