Related papers: Symbolic powers of multipartite hypergraphs and Wa…
In this paper, we investigate the degree of $h$-polynomials of edge ideals of finite simple graphs. In particular, we provide combinatorial formulas for the degree of the $h$-polynomial for various fundamental classes of graphs such as…
This paper gives some exact formulas for the depth of powers of the edge ideal of an edge-weighted integrally closed cycle.
We determine all possible triples of depth, dimension, and regularity of edge ideals of weighted oriented graphs with a fixed number of vertices. Also, we compute all the possible Betti table sizes of edge ideals of weighted oriented trees…
In this paper it is shown that it is possible to associate several polynomial ideals to a directed graph $D$ in order to find properties of it. In fact by using algebraic tools it is possible to give appropriate procedures for automatic…
We prove that the integral closures of the powers of a squarefree monomial ideal I equal the symbolic powers if and only if I is the edge ideal of a Fulkersonian hypergraph.
In the paper we give an upper bound for the Waldschmidt constants of the wide class of ideals. This generalizes the result obtained by Dumnicki, Harbourne, Szemberg and Tutaj-Gasinska, Adv. Math. 2014. Our bound is given by a root of a…
In this paper, we study the componentwise linearity of symbolic powers of edge ideals. We propose the conjecture that all symbolic powers of the edge ideal of a cochordal graph are componentwise linear. This conjecture is verified for some…
We consider the edge ideals of large classes of graphs with whiskers and for these ideals we prove that the arithmetical rank is equal to the big height. Then we extend these results to other classes of squarefree monomial ideals, generated…
In this paper, we compare the regularities of symbolic and ordinary powers of edge ideals of weighted oriented graphs. For any weighted oriented complete graph $K_n$, we show that $\reg(I(K_n)^{(k)})\leq \reg(I(K_n)^k)$ for all $k\geq 1$.…
A Cameron-Walker graph is a graph for which the matching number and the induced matching number are the same. Assume that $G$ is a Cameron-Walker graph with edge ideal $I(G)$, and let $\ind-match(G)$ be the induced matching number of $G$.…
Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehat\alpha(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition…
We propose a power-law $m$-uniform random hypergraph on $n$ vertexes. In this hypergraph, each vertex is independently assigned a random weight from a power-law distribution with exponent $\alpha\in(0,\infty)$ and the hyperedge…
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…
We survey classical and recent results on symbolic powers of ideals. We focus on properties and problems of symbolic powers over regular rings, on the comparison of symbolic and regular powers, and on the combinatorics of the symbolic…
In this paper we provide some exact formulas for the projective dimension and the regularity of edge ideals associated to three special types of vertex-weighted oriented $m$-partite graphs. These formulas are functions of the weight and…
Let $I_X$ be the saturated homogeneous ideal defining a codimension two arithmetically Cohen-Macaulay scheme $X \subseteq \mathbb{P}^n$, and let $I_X^{(m)}$ denote its $m$-th symbolic power. We are interested in when $I_X^{(m)} = I_X^m$. We…
We study the symbolic powers of the Stanley-Reisner ideal $I_{B_n}$ of a bipyramid $B_n$ over a $n-$gon $Q_n$. Using a combinatorial approach, based on analysis of subtrees in $Q_n$ we compute the Waldschmidt constant of $I_{B_n}$.
Let $K$ be a field with characteristic different from 2 and let $S$ be a symbol algebra over $K$. We compute the symmetric powers of hyperbolic quadratic forms over $K$. Also, we compute the symmetric powers of the quadratic trace form of…
This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.
Previously, Ohsugi and Hibi gave a combinatorial description of bipartite graphs $G$ whose toric edge ideal $I_G$ is generated by quadrics, showing that every cycle of $G$ of length at least $6$ must have a chord. This corresponds to the…