Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the extremal Betti numbers of the binomial edge ideal of closed graphs
74
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We study the equality of the extremal Betti numbers of the binomial edge ideal $J_G$ and those of its initial ideal ${rm in}(J_G)$ of a closed graph $G$. We prove that in some cases there is an unique extremal Betti number for ${rm in}(J_G)$ and as a consequence there is an unique extremal Betti number for $J_G$ and these extremal Betti numbers are equal
rate research
Read More
We prove that $beta_p(I(G)) = beta_{p,p+r}(I(G))$ for skew Ferrers graph $G$, where $p:=pd(I(G))$ and $r:=reg(I(G))$. As a consequence, we confirm that Ene, Herzog and Hibis conjecture is true for the Betti numbers in the last columm of Betti table. We also give an explicit formula for the unique extremal Betti number of binomial edge ideal for some closed graphs.
Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as a consequence, we get the Betti diagram of wheel graph. Also, we study Cohen-Macaulay defect of $S/J_G$ in terms of Cohen-Macaulay defect of $S_H/J_H$ and using this we construct a graph with Cohen-Macaulay defect $q$ for any $qgeq 1$. We obtain the depth of binomial edge ideal of join of graphs. Also, we prove that for any pair $(r,b)$ of positive integers with $1leq b< r$, there exists a connected graph $G$ such that $reg(S/J_G)=r$ and the number of extremal Betti number of $S/J_G$ is $b$.
Let $K$ be a field and $S = K[x_1,dots,x_n]$ be a polynomial ring over $K$. We discuss the behaviour of the extremal Betti numbers of the class of squarefree strongly stable ideals. More precisely, we give a numerical characterization of the possible extremal Betti numbers (values as well as positions) of such a class of squarefree monomial ideals.
We study homological properties of random quadratic monomial ideals in a polynomial ring $R = {mathbb K}[x_1, dots x_n]$, utilizing methods from the Erd{o}s-R{e}nyi model of random graphs. Here for a graph $G sim G(n, p)$ we consider the `coedge ideal $I_G$ corresponding to the missing edges of $G$, and study Betti numbers of $R/I_G$ as $n$ tends to infinity. Our main results involve fixing the edge probability $p = p(n)$ so that asymptotically almost surely the Krull dimension of $R/I_G$ is fixed. Under these conditions we establish various properties regarding the Betti table of $R/I_G$, including sharp bounds on regularity and projective dimension, and distribution of nonzero normalized Betti numbers. These results extend work of Erman and Yang, who studied such ideals in the context of conjectured phenomena in the nonvanishing of asymptotic syzygies. Along the way we establish results regarding subcomplexes of random clique complexes as well as notions of higher-dimensional vertex $k$-connectivity that may be of independent interest.
In this paper we prove the conjectured upper bound for Castelnuovo-Mumford regularity of binomial edge ideals posed in [23], in the case of chordal graphs. Indeed, we show that the regularity of any chordal graph G is bounded above by the number of maximal cliques of G, denoted by c(G). Moreover, we classify all chordal graphs G for which L(G) = c(G), where L(G) is the sum of the lengths of longest induced paths of connected components of G. We call such graphs strongly interval graphs. Moreover, we show that the regularity of a strongly interval graph G coincides with L(G) as well as c(G).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
