Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
133 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Stanley depth and symbolic powers of monomial ideals (1306.0542v1)

Published 3 Jun 2013 in math.AC and math.CO

Abstract: The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities ${\rm sdepth} (S/I{(ks)}) \leq {\rm sdepth} (S/I{(s)})$ and ${\rm sdepth} (I{(ks)}) \leq {\rm sdepth} (I{(s)})$ hold. If moreover $I$ is unmixed of height $d$, then we show that for every integer $k\geq1$, ${\rm sdepth}(I{(k+d)})\leq {\rm sdepth}(I{{(k)}})$ and ${\rm sdepth}(S/I{(k+d)})\leq {\rm sdepth}(S/I{{(k)}})$. Finally, we consider the limit behavior of the Stanley depth of symbolic powers of a squarefree monomial ideal. We also introduce a method for comparing the Stanley depth of factors of monomial ideals.

Summary

We haven't generated a summary for this paper yet.