Lcm-lattices and Stanley depth: a first computational approach
arXiv:1408.4255
Abstract
Let be a field, and let be the polynomial ring. Let be a monomial ideal of with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that . This shows that the Stanley conjecture is true for and , if can be generated by at most 5 monomials. The result also brings additional computational evidence for a conjecture made by Herzog.
arXiv commentTo appear in Experimental Math. ArXiv admin note: text overlap with arXiv:1405.3602