Multigraded minimal free resolutions of simplicial subclutters
Mina Bigdeli, Ali Akbar Yazdan Pour

TL;DR
This paper investigates the algebraic properties of simplicial subclutters, providing formulas for Betti numbers, and characterizes ideals with linear resolutions in terms of these structures.
Contribution
It introduces a formula for Betti numbers of ideals associated with simplicial subclutters and characterizes ideals with linear resolutions using these structures.
Findings
Betti numbers of subclutter ideals can be computed from those of the original ideal and combinatorial data.
Ideals with linear resolutions are related to simplicial subclutters of complete clutters.
Not all equigenerated square-free monomial ideals with linear quotients are associated to simplicial subclutters.
Abstract
This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter and its simplicial subclutter , we compare some algebraic properties and invariants of the ideals associated to these two clutters, respectively. We give a formula for computing the (multi)graded Betti numbers of in terms of those of and some combinatorial data about . As a result, we see that if admits a simplicial subclutter, then there exists a monomial such that the (multi)graded Betti numbers of can be computed through those of . It is proved that the Betti sequence of any graded ideal with linear resolution is the Betti sequence of an ideal associated to a simplicial subclutter of the complete clutter. These ideals turn out to have linear quotients. However, they do not form all the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
