Related papers: The $\mathrm{v}$-number of Monomial Ideals

For a graph $G$ without isolated vertices, the inverse degree of a graph $G$ is defined as $ID(G)=\sum_{u\in V(G)}d(u)^{-1}$ where $d(u)$ is the number of vertices adjacent to the vertex $u$ in $G$. By replacing $-1$ by any non-zero real…

Given a graph G, a subset M of V (G) is a module of G if for each v \in V (G) \diagdownM, v is adjacent to all the elements of M or to none of them. For instance, V(G), \varnothing and {v} (v \in V(G)) are modules of G called trivial. Given…

We will explore some properties of minimal graded free resolutions of $R/I$, where $R$ is a trivariate polynomial ring over a field and $I$ is a monomial ideal. Our focus will be to consider a specific form of the resolutions when $I$ is…

Let $I(G)$ be the edge ideal of a simple graph $G$. We prove that $I(G)^2$ has a linear free resolution if and only if $G$ is gap-free and reg$I(G) \le 3$. Similarly, we show that $I(G)^3$ has a linear free resolution if and only if $G$ is…

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

Given an integer $\Delta \ge 3$, let ${\cal G}_{\Delta }$ be the set of connected graphs $G\neq K_{\Delta +1}$ with maximum degree $\Delta $ and, for $i=1,\cdots, \Delta $, let $V_i(G)$ be the set of vertices of $G$ of degree $i$. \\ We…

We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.

Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we completely determine the tuples $(\dim R/I(G), \depth (R/I(G)), \reg (R/I(G)))$ when the number of vertices is fixed for any graphs $G$.

Assume that $G$ is a graph with edge ideal $I(G)$ and matching number ${\rm match}(G)$. For every integer $s\geq 1$, we denote the $s$-th squarefree power of $I(G)$ by $I(G)^{[s]}$. It is shown that for every positive integer $s\leq {\rm…

Let $I\subset S$ be a graded ideal of a standard graded polynomial ring $S$ with coefficients in a field $K$, and let $\text{v}(I)$ be the $\text{v}$-number of $I$. In previous work, we showed that for any graded ideal $I\subset S$…

We introduce a new class of polynomial ideals associated to a simple graph, $G$. Let $K[E_G]$ be the polynomial ring on the edges of $G$ and $K[V_G]$ the polynomial ring on the vertices of $G$. We associate to $G$ an ideal, $I(X_G)$,…

In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…

Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$, $\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence number and matching number of $G$, respectively. Recently, Caro, Davila and Pepper…

We study the defining equations of the Rees algebra of square-free monomial ideals in a polynomial ring over a field. We determine that when an ideal $I$ is generated by $n$ square-free monomials of the same degree then $I$ has relation…

Let $\Lambda$ be a numerical semigroup and $I\subset \Lambda$ be an ideal of $\Lambda$. The graph $G_I(\Lambda)$ assigned to an ideal $I$ of $\Lambda$ is a graph with elements of $(\Lambda \setminus I)^*$ as vertices and any two vertices…

Given a graph $G$, the number of its vertices is represented by $n(G)$, while the number of its edges is denoted as $m(G)$. An independent set in a graph is a set of vertices where no two vertices are adjacent to each other and the size of…

Let $R$ be a commutative ring and ${\Bbb{A}}(R)$ be the set of ideals with non-zero annihilators. The annihilating-ideal graph of $R$ is defined as the graph ${\Bbb{AG}}(R)$ with the vertex set ${\Bbb{A}}(R)^*={\Bbb{A}}\setminus\{(0)\}$ and…

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

We study the binomial and monomial ideals arising from linear equivalence of divisors on graphs from the point of view of Gr\"obner theory. We give an explicit description of a minimal Gr\"obner bases for each higher syzygy module. In each…

Let $I$ be a monomial ideal in a polynomial ring. In this paper, we study the asymptotic behavior of the set of associated radical ideals of the (symbolic) powers of $I$. We show that both $\asr(I^s)$ and $\asr(I^{(s)})$ need not stabilize…