Systems of parameters and the Cohen-Macaulay property
From MaRDI portal
Publication:5896848
DOI10.1007/S10801-021-01046-6zbMATH Open1480.13018arXiv2006.16549OpenAlexW3161976823MaRDI QIDQ5896848FDOQ5896848
Authors: Jürgen Herzog, Somayeh Moradi
Publication date: 17 December 2021
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Abstract: We recall a numerical criteria for Cohen--Macaulayness related to system of parameters, and introduce monomial ideals of K"onig type which include the edge ideals of K"onig graphs. We show that a monomial ideal is of K"onig type if and only if its corresponding residue class ring admits a system of parameters whose elements are of the form . This provides an algebraic characterization of K"onig graphs. We use this special parameter systems for the study of the edge ideal of K"onig graphs and the study of the order complex of a certain family of posets. Finally, for any simplicial complex we introduce a system of parameters for with a universal construction principle, independent of the base field and only dependent on the faces of . This system of parameters is an efficient tool to test Cohen--Macaulayness of the Stanley--Reisner ring of a simplicial complex.
Full work available at URL: https://arxiv.org/abs/2006.16549
Recommendations
Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Special types (Cohen-Macaulay, Gorenstein, Buchsbaum, etc.) (13H10)
Cites Work
- Combinatorics and commutative algebra.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Integral closure of ideals, rings, and modules
- Title not available (Why is that?)
- Monomial Ideals
- Combinatorial characterizations of generalized Cohen-Macaulay monomial ideals
- Title not available (Why is that?)
- On well-covered, vertex decomposable and Cohen-Macaulay graphs
- Vertex decomposability and regularity of very well-covered graphs
- Semigroup rings and simplicial complexes
- Characteristic-independence of Betti numbers of graph ideals
- An upper bound for the number of maximal independent sets in a graph
- Ein Cohen-Macaulay Kriterium mit Anwendungen auf den Konormalenmodul und den Differentialmodul
- Coverings, matchings and the number of maximal independent sets of graphs
- On the Cohen-Macaulay property in commutative algebra and simplicial topology
Cited In (4)
This page was built for publication: Systems of parameters and the Cohen-Macaulay property
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896848)