On the Stanley depth of edge ideals of line and cyclic graphs

Abstract

We prove that the edge ideals of line and cyclic graphs and their quotient rings satisfy the Stanley conjecture. We compute the Stanley depth for the quotient ring of the edge ideal associated to a cycle graph of length n, given a precise formula for n 0,2 3 and tight bounds for n 1 3. Also, we give bounds for the Stanley depth of a quotient of two monomial ideals, in combinatorial terms.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…