LCM Lattices and Stanley Depth: A First Computational Approach

Abstract: Let

m a t h b b K

be a field, and let

S = m a t h b b K [X_{1}, ..., X_{n}]

be the polynomial ring. Let

I

be a monomial ideal of

S

with up to 5 generators. In this paper, we present a computational experiment which allows us to prove that

m a t h r m {d e p t h}_{S} S / I = m a t h r m {s d e p t h}_{S} S / I < m a t h r m {s d e p t h}_{S} I

. This shows that the Stanley conjecture is true for

S / I

and

I

, if

I

can be generated by at most 5 monomials. The result also brings additional computational evidence for a conjecture made by Herzog.

Recommendations

Cites work

Cited in

(7)

Describes a project that uses

Uses Software

This page was built for publication: LCM Lattices and Stanley Depth: A First Computational Approach