2000 character limit reached
On the Regularity of squarefree part of symbolic powers of edge ideals
Published 5 Mar 2023 in math.AC and math.CO | (2303.02791v1)
Abstract: Assume that $G$ is a graph with edge ideal $I(G)$. For every integer $s\geq 1$, we denote the squarefree part of the $s$-th symbolic power of $I(G)$ by $I(G){{s}}$. We determine an upper bound for the regularity of $I(G){{s}}$ when $G$ is a chordal graph. If $G$ is a Cameron-Walker graphs, we compute ${\rm reg}(I(G){{s}}$ in terms of the induced matching number of $G$. Moreover, for any graph $G$, we provide sharp upper bounds for ${\rm reg}(I(G){{2}})$ and ${\rm reg}(I(G){{3}})$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.