Let $G$ be a finite simple graph and $J(G)$ denote its cover ideal in a polynomial ring over a field $\mathbb{K}$. In this paper, we show that all symbolic powers of cover ideals of certain vertex decomposable graphs have linear quotients. Using these results, we give various conditions on a subset $S$ of the vertices of $G$ so that all symbolic powers of vertex cover ideals of $G \cup W(S)$, obtained from $G$ by adding a whisker to each vertex in $S$, have linear quotients. For instance, if $S$ is a vertex cover of $G$, then all symbolic powers of $J(G \cup W(S))$ have linear quotients. Moreover, we compute the Castelnuovo-Mumford regularity of symbolic powers of certain cover ideals.
We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an algebra is normal and Cohen-Macaulay if the monomial ideal is squarefree. For a simple graph, the vertex cover algebra is generated by elements of degree 2, and it is standard graded if and only if the graph is bipartite. We also give a general upper bound for the maximal degree of the generators of vertex cover algebras.
Let G be a simple graph and let J be its ideal of vertex covers. We give a graph theoretical description of the irreducible b-vertex covers of G, i.e., we describe the minimal generators of the symbolic Rees algebra of J. Then we study the irreducible b-vertex covers of the blocker of G, i.e., we study the minimal generators of the symbolic Rees algebra of the edge ideal of G. We give a graph theoretical description of the irreducible binary b-vertex covers of the blocker of G. It is shown that they correspond to irreducible induced subgraphs of G. As a byproduct we obtain a method, using Hilb…
In this paper we study irreducible representations and symbolic Rees algebras of monomial ideals. Then we examine edge ideals associated to vertex-weighted oriented graphs. These are digraphs having no oriented cycles of length two with weights on the vertices. For a monomial ideal with no embedded primes we classify the normality of its symbolic Rees algebra in terms of its primary components. If the primary components of a monomial ideal are normal, we present a simple procedure to compute its symbolic Rees algebra using Hilbert bases, and give necessary and sufficient conditions for the equ…
Let $G$ be a graph with $n$ vertices and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that if $G$ is a very well-covered graph such that $J(G)$ has linear resolution, then $J(G)^{(k)}$ has linear resolution, for every integer $k\geq 1$. We also prove that for a every very well-covered graph $G$, the depth of symbolic powers of $J(G)$ forms a non-increasing sequence. Finally, we determine a linear upper bound for the regularity of powers of cov…
Let $G$ be a graph which belongs to either of the following classes: (i) bipartite graphs, (ii) unmixed graphs, or (iii) claw--free graphs. Assume that $J(G)$ is the cover ideal $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that$$k{\rm deg}(J(G))\leq {\rm reg}(J(G)^{(k)})\leq (k-1){\rm deg}(J(G))+|V(G)|-1.$$We also determine families of graphs for which the above inequalities are equality.
It is proved that all vertex cover algebras of a hypergraph are standard graded if and only if the hypergraph is unimodular. This has interesting consequences on the symbolic powers of monomial ideals.
For any graph $G$, assume that $J(G)$ is the cover ideal of $G$. Let $J(G)^{(k)}$ denote the $k$th symbolic power of $J(G)$. We characterize all graphs $G$ with the property that $J(G)^{(k)}$ has a linear resolution for some (equivalently, for all) integer $k\geq 2$. Moreover, it is shown that for any graph $G$, the sequence $\big({\rm reg}(J(G)^{(k)})\big)_{k=1}^{\infty}$ is nondecreasing. Furthermore, we compute the largest degree of minimal generators of $J(G)^{(k)}$ when $G$ is either an unmixed of a claw-free graph.
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph and its blowups. As a result, perfect graphs play an important role in the theory, dual to the role played by perfect graphs in the theory of secants of monomial ideals. We use Gröbner degenerations as a tool to reduce questions about symbolic powers of arbitrary ideals to the monomial case. Among the applications are a new, unified approach to the Gröbner b…
In this paper, we compute the regularity and Hilbert series of symbolic powers of the cover ideal of a graph $G$ when $G$ is either a crown graph or a complete multipartite graph. We also compute the multiplicity of symbolic powers of cover ideals in terms of the number of edges.
Let $G_{n,r}$ denote the graph with $n$ vertices $\{x_1,\ldots,x_n\}$ in cyclic order and for each vertex $x_i$ consider the set $A_i=\{x_{i-r},\ldots,x_{i-1},x_{i+1},x_{i+2},\ldots, x_{i+r}\},$ where $x_{i-j}$ is the vertex $x_{n+i-j}$, whenever $i<j$ and $0\leq r\leq \Bigl\lfloor\dfrac{n}{2}\Bigr\rfloor -1$. In $G_{n,r}$, every vertex $x_i$ is adjacent to all the vertices of $V(G_{n,r})\backslash A_i$. Let $I=I(G_{n,r})$ be the edge ideal of $G_{n,r}$. We show that Minh's conjecture is true for $I,$ i.e. regularity of ordinary powers and symbolic powers of $I$ are equal. We compute the Walds…
Let $G$ be a graph with $n$ vertices and let $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We prove that the sequences $\{{\rm sdepth}(S/J(G)^{(k)})\}_{k=1}^\infty$ and $\{{\rm sdepth}(J(G)^{(k)})\}_{k=1}^\infty$ are non-increasing and hence convergent. Suppose that $ν_{o}(G)$ denotes the ordered matching number of $G$. We show that for every integer $k\geq 2ν_{o}(G)-1$, the modules $J(G)^{(k)}$ and $S/J(G)^{(k)}$ satisfy the Stanley's inequality. We al…
We show that attaching a whisker (or a pendant) at the vertices of a cycle cover of a graph results in a new graph with the following property: all symbolic powers of its cover ideal are Koszul or, equivalently, componentwise linear. This extends previous work where the whiskers were added to all vertices or to the vertices of a vertex cover of the graph.
Let $I$ be an ideal whose symbolic Rees algebra is Noetherian. For $m \geq 1$, the $m$-th symbolic defect, sdefect$(I,m)$, of $I$ is defined to be the minimal number of generators of the module $\frac{I^{(m)}}{I^m}$. We prove that sdefect$(I,m)$ is eventually quasi-polynomial as a function in $m$. We compute the symbolic defect explicitly for certain monomial ideals arising from graphs, termed cover ideals. We go on to give a formula for the Waldschmidt constant, an asymptotic invariant measuring the growth of the degrees of generators of symbolic powers, for ideals whose symbolic Rees algebra…
Let G be a perfect graph and let J be its ideal of vertex covers. We show that the Rees algebra of J is normal and that this algebra is Gorenstein if G is unmixed. Then we give a description--in terms of cliques--of the symbolic Rees algebra and the Simis cone of the edge ideal of G.
Let $D$ be a weighted oriented graph with the underlying graph $G$ when vertices with non-trivial weights are sinks and $I(D), I(G) $ be the edge ideals corresponding to $D$ and $G,$ respectively. We give explicit description of the symbolic powers of $I(D)$ using the concept of strong vertex covers. We show that the ordinary and symbolic powers of $I(D)$ and $I(G)$ behave in a similar way. We provide a description for symbolic powers and Waldschmidt constant of $I(D)$ for certain classes of weighted oriented graphs. When $D$ is a weighted oriented odd cycle we compute $\reg (I(D)^{(s)}/I(D)^s…
We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a construction on a graph called a clique multi-whiskering which always produces vertex cover ideals with componentwise linear powers.
We compute the reduced Gröbner basis of the toric ideal with respect to a suitable monomial order and we study the Hilbert series of the vertex cover algebra $A(G)$, where $G$ is an unmixed bipartite graph without isolated vertices.
J. Herzog, T. Hibi, N. V. Trung and X. Zheng characterize the vertex cover algebras which are standard graded. In this paper we give a simple combinatorial criterion for the standard graded property of vertex cover algebras in the case of quasi-trees. We also give an example of how this criterion works and compute the maximal degree of a minimal generator in that case.
The aim of this paper is to characterize simplicial complexes which have standard graded vertex cover algebras. This property has several nice consequences for the squarefree monomial ideals defining these algebras. It turns out that such simplicial complexes are closely related to a range of hypergraphs which generalize bipartite graphs and trees. These relationships allow us to obtain very general results on standard graded vertex cover algebras which cover previous major results on Rees algebras of squarefree monomial ideals.
We give a new combinatorial characterization of the big height of a squarefree monomial ideal leading to a new bound for the projective dimension of a monomial ideal.
In a paper in 2008, Herzog, Hibi and Ohsugi introduced and studied the semigroup ring associated to the set of minimal vertex covers of an unmixed bipartite graph. In this paper we relate the dimension of this semigroup ring to the rank of the Boolean lattice associated to the graph.
Let C be a clutter and let I be its edge ideal. We present a combinatorial description of the minimal generators of the symbolic Rees algebra Rs(I) of I. It is shown that the minimal generators of Rs(I) are in one to one correspondence with the irreducible parallelizations of C. From our description some major results on symbolic Rees algebras of perfect graphs and clutters will follow. As a byproduct, we give a method, using Hilbert bases, to compute all irreducible parallelizations of C along with all the corresponding vertex covering numbers.
Let $G$ be a graph and $I=I(G)$ be its edge ideal. When $G$ is the clique sum of two different length odd cycles joined at single vertex then we give an explicit description of the symbolic powers of $I$ and compute the Waldschmidt constant. When $G$ is complete graph then we describe the generators of the symbolic powers of $I$ and compute the Waldschmidt constant and the resurgence of $I$. Moreover for complete graph we prove that the Castelnuvo-Mumford regularity of the symbolic powers and ordinary powers of the edge ideal coincide.
In this paper we introduce squarefree vertex cover algebras. We study the question when these algebras coincide with the ordinary vertex cover algebras and when these algebras are standard graded. In this context we exhibit a duality theorem for squarefree vertex cover algebras.
In this paper, we describe primary decomposition of the edge ideal of the join of some graphs in terms of that information of the edge ideal of every weighted oriented graph. Meanwhile, we also study depth and regularity of symbolic powers and ordinary powers of such an edge ideal. We explicitly compute depth and regularity of ordinary powers of the edge ideal of the join of two graphs consisting of isolated vertices, and also provide upper bounds of regularity of symbolic powers of such an edge ideal. For the edge ideal of the join of two graphs with at least an oriented edge for per graph, w…
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a generator of A(I) in the case that I is a modification of the vertex cover ideal of a bipartite graph, and show that this highest degree can be any given number. We furthermore give an upper bound for the highest degree of a generator of the integral closure of A(I) in the case that I is a monomial ideal which is generically a complete intersection.
We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the concept of minimum edge cover for an induced subgraph in a graph. We describe one method to find the quasi-polynomial associated with the symbolic defects of edge ideal $I$. We classify the class of unicyclic graphs when some power of maximal ideal annihilates $ I^{(s)}/I^s $ for any fixed $ s $. Also for those class of graphs, we compute the Hilbert function o…
We define vertex cover algebras for weighted simplicial multicomplexes and prove basics properties of them. Also, we describe these algebras for multicomplexes which have only one maximal facet and we prove that they are finitely generated.
