Related papers: A study of $v$-number for some monomial ideals

Let $I(G)$ be the edge ideal of a simple graph $G$ over a field k. We prove that $${\rm reg}(\overline {I(G)^s}) = {\rm reg}(I(G)^s),$$ for all $s \le 4$. Furthermore, we provide an example of a graph $G$ such that $${\rm reg} I(G)^s = {\rm…

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 give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.

Let $R = \mathbb{K}[x_1, \ldots, x_n]$ and $I \subset R$ be a homogeneous ideal. In this article, we first obtain certain sufficient conditions for the subadditivity of $R/I$. As a consequence, we prove that if $I$ is generated by…

Let $G$ be a finite simple graph on $n$ vertices and set $R=\Bbbk[x_1,\dots,x_n]$, with edge ideal $I(G)$ and cover ideal $J(G)$. We give an explicit description of the $h$-polynomial of $R/J(G)$, in a form that extends to the Alexander…

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…

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…

Let X be an algebraic toric set in a projective space over a finite field. We study the vanishing ideal, I(X), of X and show some useful degree bounds for a minimal set of generators of I(X). We give an explicit description of a set of…

Consider a graph on the non-singular matrices over a finite field, in which two distinct non-singular matrices are joined by an edge whenever their sum is singular. We prove an upper bound for the independence number of this graph. As a…

Let $R = \mathbb{K}[x_1, \ldots, x_n]$ be a polynomial ring over a field $\mathbb{K}$, and let $I \subseteq R$ be a monomial ideal of height $h$. We provide a formula for the multiplicity of the powers of $I$ when all the primary ideals of…

Let $I$ be an arbitrary nonzero squarefree monomial ideal of dimension $d$ in a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_n]$. Let $\mu$ be the number of associated primes of $S/I$ of dimension $d$. We prove that the multiplicity of…

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…

We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.

We prove that for any toric ideal of a graph the degree of any element of Graver basis is bounded above by an exponential function of the maximal degree of a circuit.

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…

Let $I$ be a monomial ideal $I$ in a polynomial ring $R = k[x_1,...,x_r]$. In this paper we give an upper bound on $\overline{\dstab} (I)$ in terms of $r$ and the maximal generating degree $d(I)$ of $I$ such that $\depth R/\overline{I^n}$…

Let $G$ be a graph without isolated vertices and let $\alpha(G)$ be its stability number and $\tau(G)$ its covering number. The {\it $\alpha_{v}$-cover} number of a graph, denoted by $\alpha_{v}(G)$, is the maximum natural number $m$ such…

We show that the universal Gr\"obner basis and the Graver basis of a binomial edge ideal coincide. We provide a description for this basis set in terms of certain paths in the underlying graph. We conjecture a similar result for a parity…

Let $G=(V(G),E(G))$ be a graph with set of vertices $V(G)$ and set of edges $E(G)$. For $k\ge 0$ an integer, a subset $I_k$ of $V(G)$ is called a $k$-nearly independent vertex subset of $G$ if $I_k$ induces a subgraph of size $k$ in $G$.…

Let $G$ be a finite graph on $[n]:=\{1, \ldots, n\}$ and $\kappa(G)$ its vertex connectivity. Let $S=K[x_1, \ldots, x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I(G^c)$ the edge ideal of the complementary graph…