On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint

DOI10.1142/S1005386717000402MaRDI QIDQ4594978zbMATH OpenFDO

Authors Ashkan Nikseresht, Rashid Zaare-Nahandi

Publication date 27 November 2017

Published in Algebra Colloquium (Search for Journal in Brave)

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

zbMATH Keywords

chordal cluttercyclelinear resolutionsimplicial complexsquarefree monomial ideal

Mathematics Subject Classification ID

Combinatorial aspects of simplicial complexes (05E45) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Abstract: In this paper, we study the notion of chordality and cycles in hypergraphs from a commutative algebraic point of view. The corresponding concept of chordality in commutative algebra is having a linear resolution. However, there is no unified definition for cycle or chordality in hypergraphs in the literature, so we consider several generalizations of these notions and study their algebraic interpretations. In particular, we investigate the relationship between chordality and having linear quotients in some classes of hypergraphs. Also we show that if $mathcalC$ is a hypergraph such that $langlemathcalCangle$ is a vertex decomposable simplicial complex or $$ is squarefree stable, then $mathcalC$ is chordal according to one of the most promising definitions.

Recommendations

• Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution
• On the Stanley depth of edge ideals of line and cyclic graphs
• Chordality, \(d\)-collapsibility, and componentwise linear ideals
• Chordality of clutters with vertex decomposable dual and ascent of clutters
• Regularity and Free Resolution of Ideals Which Are Minimal To d-Linearity
• On linear quotients of squarefree monomial ideals
• The linear syzygy graph of a monomial ideal and linear resolutions
• Stability of Betti numbers under reduction processes: towards chordality of clutters
• Dirac's theorem on chordal graphs and Alexander duality
• Monomial ideals of graphs with loops

Cited in

(18)

• Clutters and semimatroids
• Exposed circuits, linear quotients, and chordal clutters
• Multigraded minimal free resolutions of simplicial subclutters
• Trung's construction and the Charney-Davis conjecture
• Chordality, \(d\)-collapsibility, and componentwise linear ideals
• Chordality of clutters with vertex decomposable dual and ascent of clutters
• Simplicial orders and chordality
• Decomposable clutters and a generalization of Simon's conjecture
• Regularity and Free Resolution of Ideals Which Are Minimal To d-Linearity
• Squarefree zero-divisor graphs of Stanley-Reisner rings
• Edgewise strongly shellable clutters
• Deriving some properties of Stanley-Reisner rings from their squarefree zero-divisor graph
• Stability of Betti numbers under reduction processes: towards chordality of clutters
• A class of hypergraphs that generalizes chordal graphs
• On Gorenstein circulant graphs
• Line graphs with a Cohen-Macaulay or Gorenstein clique complex
• Chordal and sequentially Cohen-Macaulay clutters
• Some combinatorial characterizations of Gorenstein graphs with independence number less than four

This page was built for publication: On Generalization of Cycles and Chordality to Clutters from an Algebraic Viewpoint

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