Reveals complete characterizations of Cohen-Macaulayness in two classes of clutters, indicating significant outcomes for combinatorial algebra.
In combinatorial commutative algebra, to characterize the Cohen-Macaulayness of some classes of graphs is an important topic. In this paper, we give complete characterizations for the Cohen-Macaulayness of two classes of clutters. One is interval clutters, a subclass of 𝛽-acyclic clutters; the other is 𝛽-cycles.
No takes yet. Share an insight, caveat, or question.
Li et al. (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: