Monomial ideal;
Stanley's conjecture;
Stanley decompositions;
Stanley depth;
CONJECTURE;
D O I:
暂无
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
We give upper bounds for the Stanley depth of edge ideals of certain k-partite clutters. In particular, we generalize a result of Ishaq about the Stanley depth of the edge ideal of a complete bipartite graph. A result of Pournaki, Seyed Fakhari and Yassemi implies that the Stanley's conjecture holds for d-uniform complete d-partite clutters. Here we give a shorter and different proof of this fact.
机构:
PSL Res Univ, Univ Paris Dauphine, CNRS,UMR 7243, LAMSADE, F-75016 Paris, FrancePSL Res Univ, Univ Paris Dauphine, CNRS,UMR 7243, LAMSADE, F-75016 Paris, France
Harutyunyan, Ararat
Harutyunyan, Louisa
论文数: 0引用数: 0
h-index: 0
机构:
Univ Toronto Mississauga, Dept Math & Computat Sci, Mississauga, ON, CanadaPSL Res Univ, Univ Paris Dauphine, CNRS,UMR 7243, LAMSADE, F-75016 Paris, France
Harutyunyan, Louisa
Hovhannisyan, Narek
论文数: 0引用数: 0
h-index: 0
机构:
Concordia Univ, Dept Comp Sci & Software Engn, Montreal, PQ, CanadaPSL Res Univ, Univ Paris Dauphine, CNRS,UMR 7243, LAMSADE, F-75016 Paris, France