Related papers: Arithmetical rank of binomial ideals

In this paper, we prove the upper bound conjecture proposed by Saeedi Madani \& Kiani on the Castelnuovo-Mumford regularity of generalized binomial edge ideals. We give a combinatorial upper bound of regularity for generalized binomial edge…

The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this note we present the first exact algorithm for the minimum rank…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…

We give a combinatorial characterisation of connected graphs whose binomial edge ideals are of K\"{o}nig type, developed independently to the similar characterisation given by LaClair in arXiv:2304.13299, and exhibit some classes of graphs…

In this paper, we investigate some properties of symbolic powers and symbolic Rees algebras of binomial edge ideals associated with some classes of block graphs. First, it is shown that symbolic powers of binomial edge ideals of pendant…

The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…

We classify generalized block graphs whose binomial edge ideals admit a unique extremal Betti number. We prove that the Castelnuovo-Mumford regularity of binomial edge ideals of generalized block graphs is bounded below by $m(G)+1$, where…

We classify all normal edge ideals of edge-weighted graphs.

The $\mathrm{v}$-number of a graded ideal $I\subseteq R$, denoted by $\mathrm{v}(I)$, is the minimum degree of a polynomial $f$ for which $I:f$ is a prime ideal. Jaramillo and Villarreal (J Combin Theory Ser A 177:105310, 2021) studied the…

The cut-rank of a set $X$ of vertices in a graph $G$ is defined as the rank of the $ X \times (V(G)\setminus X)$ matrix over the binary field whose $(i,j)$-entry is $1$ if the vertex $i$ in $X$ is adjacent to the vertex $j$ in…

In this paper, we give formulas for $v$-number of edge ideals of some graphs like path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two cycles and join of two graphs. For an $\mathfrak{m}$-primary monomial ideal $I\subset…

This paper presents exact formulas for the regularity and depth of powers of edge ideals of an edge-weighted star graph. Additionally, we provide exact formulas for the regularity of powers of the edge ideal of an edge-weighted integrally…

In this paper, we study the rank of matrices of bicomplex numbers. The relationship between rank, idempotent column rank and idempotent row rank is examined. Then, the solution of a system of equations in bicomplex space is presented using…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…

We classify the bipartite graphs $G$ whose binomial edge ideal $J_G$ is Cohen-Macaulay. The connected components of such graphs can be obtained by gluing a finite number of basic blocks with two operations. In this context we prove the…

We consider the ideal of inner $2$-minors $I_{\mathcal{P}}$ of a finite set of cells $\mathcal{P}$, which we call the cell ideal of $\mathcal{P}$. A nice interpretation for the height of an unmixed ideal $I_{\mathcal{P}}$, in terms of the…

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$th entry (for $i\neq j$) is nonzero whenever $\{i,j\}$ is an edge in $G$ and is zero otherwise. Minimum rank is a…

Let $G$ be a finite simple graph and $J(G)$ denote its vertex cover ideal in a polynomial ring over a field. % $\mathbb{K}$. The $k$-th symbolic power of $J(G)$ is denoted by $J(G)^{(k)}$. In this paper, we give a criteria for cover ideals…

We study unmixed and Cohen-Macaulay properties of the binomial edge ideal of some classes of graphs. We compute the depth of the binomial edge ideal of a generalized block graph. We also characterize all generalized block graphs whose…

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…