We prove a tight lower bound on the algebraic Betti numbers of tree and forest ideals and an upper bound on certain graded Betti numbers of squarefree monomial ideals.

We show that Stanley’s Conjecture holds for square free monomial ideals in five variables, that is the Stanley depth of a square free monomial ideal in five variables is greater or equal with its depth.

Classically, Gröbner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build on these ideas by providing a class of valuations on k(x, y) that are suitable for this framework. For these valuations, we compute ν(k[x, y]∗) and use this ...

Proofs of two results about a monomial ideal – describing membership in auxiliary ideals associated to the monomial ideal – are given which do not invoke resolution of singularities. The AM–GM inequality is used as a substitute for taking a log resolution of the monomial ideal.

Gröbner basis techniques in the algebraic study of triangulations of convex polytopes as well as of the number of faces of simplicial complexes will be discussed. Of these two traditional topics in combinatorics, the first will be studied by using initial ideals of toric ideals and the second will be studied by using generic initial ideals of monomial ideals.