Papers
Topics
Authors
Recent
Search
2000 character limit reached

On the Stanley depth of powers of edge ideals

Published 16 Sep 2015 in math.AC and math.CO | (1509.04988v1)

Abstract: Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Let $G$ be a graph with $n$ vertices. Assume that $I=I(G)$ is the edge ideal of $G$ and $p$ is the number of its bipartite connected components. We prove that for every positive integer $k$, the inequalities ${\rm sdepth}(Ik/I{k+1})\geq p$ and ${\rm sdepth}(S/Ik)\geq p$ hold. As a consequence, we conclude that $S/Ik$ satisfies the Stanley's inequality for every integer $k\geq n-1$. Also, it follows that $Ik/I{k+1}$ satisfies the Stanley's inequality for every integer $k\gg 0$. Furthermore, we prove that if (i) $G$ is a non-bipartite graph, or (ii) at least one of the connected components of $G$ is a tree with at least one edge, then $Ik$ satisfies the Stanley's inequality for every integer $k\geq n-1$. Moreover, we verify a conjecture of the author in special cases.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.