科研之友
微信
新浪微博
Facebook
分享链接
摘要
We introduce the concept of edgewise domination in clutters and use it to provide an upper bound for the projective dimension of any squarefree monomial ideal. We then compare this bound to a bound given by Faltings. Finally, we study a family of clutters associated to graphs and compute domination parameters for certain classes of these clutters.
- 出版日期2015-2
