Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution

DOI10.1016/J.JCTA.2013.05.009MaRDI QIDQ2349199zbMATH OpenOpenAlexFDO

Authors E. Connon, Sara Faridi

Publication date 19 June 2015

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

chordal graphchordal hypergraphfacet complexlinear resolutionmonomial idealsimplicial complexsimplicial homologyStanley-Reisner complex

Mathematics Subject Classification ID

Hypergraphs (05C65) Combinatorial aspects of simplicial complexes (05E45)

Abstract: In this paper we extend one direction of Fr"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.

Recommendations

• A criterion for a monomial ideal to have a linear resolution in characteristic 2
• Linearity of free resolutions of monomial ideals
• Chordality, \(d\)-collapsibility, and componentwise linear ideals
• Monomial ideals whose powers have a linear resolution
• Linear resolutions and polymatroidal ideals
• Linear resolutions of quadratic monomial ideals
• scientific article; zbMATH DE number 5322296
• scientific article; zbMATH DE number 3963995
• Rings with monomial relations having linear resolutions
• The linear syzygy graph of a monomial ideal and linear resolutions

Cited in

(16)

• Exposed circuits, linear quotients, and chordal clutters
• A criterion for a monomial ideal to have a linear resolution in characteristic 2
• Chordality, \(d\)-collapsibility, and componentwise linear ideals
• Chordality of clutters with vertex decomposable dual and ascent of clutters
• Simplicial orders and chordality
• Linear resolutions of quadratic monomial ideals
• Higher chordality: from graphs to complexes
• Regularity and Free Resolution of Ideals Which Are Minimal To d-Linearity
• Squarefree zero-divisor graphs of Stanley-Reisner rings
• On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint
• F-ideals and f-graphs
• Deriving some properties of Stanley-Reisner rings from their squarefree zero-divisor graph
• Stanley-Reisner rings
• Stability of Betti numbers under reduction processes: towards chordality of clutters
• A class of hypergraphs that generalizes chordal graphs
• Edge ideals with linear quotients and without homological linear quotients

This page was built for publication: Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2349199)