Multiplicity Bounds for Quadratic Monomial Ideals

Simple item page
dc.creatorKummini, Manoj
dc.date2007-07-09
dc.date2007-10-15
dc.date.accessioned2026-07-07T08:35:52Z
dc.date.available2026-07-07T08:35:52Z
dc.descriptionWe prove the multiplicity bounds conjectured by Herzog-Huneke-Srinivasan and Herzog-Srinivasan in the following cases: the strong conjecture for edge ideals of bipartite graphs, and the weaker Taylor bound conjecture for all quadratic monomial ideals. We attach a directed graph to a bipartite graph with perfect matching, and describe operations on the directed graph that would reduce the problem to a Cohen-Macaulay bipartite graph. We determine when equality holds in the conjectured bound for edge ideals of bipartite graphs, and verify that when equality holds, the resolution is pure. We characterize bipartite graphs that have Cohen-Macaulay edge ideals and quasi-pure resolutions.
dc.descriptionNew sections added, changes to some proofs
dc.identifierhttps://arxiv.org/abs/0707.1311
dc.identifierhttp://arxiv.org/abs/0707.1311
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139886
dc.subjectCommutative Algebra
dc.subjectCombinatorics
dc.subject13H15; 13F55
dc.titleMultiplicity Bounds for Quadratic Monomial Ideals
dc.typetext

Files

Collections

arXiv