Multigraded minimal free resolutions of 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 equigenerated square-free monomial ideals with linear quotients. If admits as a simplicial subclutter, then has linear resolution over all fields. Examples show that the converse is not true.
Keywords
Cite
@article{arxiv.2010.01012,
title = {Multigraded minimal free resolutions of simplicial subclutters},
author = {Mina Bigdeli and Ali Akbar Yazdan Pour},
journal= {arXiv preprint arXiv:2010.01012},
year = {2020}
}