Papers
Topics
Authors
Recent
Search
2000 character limit reached

Componentwise Linearity of Powers of Cover Ideals

Published 1 Jul 2021 in math.AC | (2107.00739v2)

Abstract: Let GG be a finite simple graph and J(G)J(G) denote its vertex cover ideal in a polynomial ring over a field. % K\mathbb{K}. The kk-th symbolic power of J(G)J(G) is denoted by J(G)<sup>(k)J(G)<sup>{(k)}. In this paper, we give a criteria for cover ideals of vertex decomposable graphs to have the property that all their symbolic powers are not componentwise linear. Also, we give a necessary and sufficient condition on GG so that J(G)<sup>(k)J(G)<sup>{(k)} is a componentwise linear ideal for some (equivalently, for all) k≥2k \geq 2 when GG is a graph such that G∖NG[A]G \setminus N_G[A] has a simplicial vertex for any independent set AA of GG. Using this result, we prove that J(G)<sup>(k)J(G)<sup>{(k)} is a componentwise linear ideal for several classes of graphs for all k≥2k \geq 2. In particular, if GG is a bipartite graph, then J(G)J(G) is a componentwise linear ideal if and only if J(G)<sup>kJ(G)<sup>k is a componentwise linear ideal for some (equivalently, for all) k≥2k \geq 2.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

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.