相关论文: Joins, Ears and Castelnuovo-Mumford regularity

Multigraded Castelnuovo--Mumford regularity of a module $M$ over the total coordinate ring $S$ of a smooth projective toric variety $X$ is a region $\operatorname{reg} M \subset \operatorname{Pic} X$ invariant under translation by the nef…

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…

In this paper we give upper bounds for the regularity of edge ideal of some classes of graphs in terms of invariants of graph. We introduce two numbers $a'(G)$ and $n(G)$ depending on graph $G$ and show that for a vertex decomposable graph…

Castelnuovo-Mumford regularity is an important invariant of projective algebraic varieties. A well known conjecture due to Eisenbud and Goto gives a bound for regularity in terms of the codimension and degree,i.e., Castelnuovo-Mumford…

When M is a finitely generated graded module over a standard graded algebra S and I is an ideal of S, it is known from work of Cutkosky, Herzog, Kodiyalam, R\"omer, Trung and Wang that the Castelnuovo-Mumford regularity of I^mM has the form…

Let $G$ be a finite simple connected graph on the vertex set $V(G)=[d]=\{1,\dots ,d\}$, with edge set $E(G)=\{e_{1},\dots , e_{n}\}$. Let $K[\mathbf{t}]=K[t_{1},\dots , t_{d}]$ be the polynomial ring in $d$ variables over a field $K$. The…

We prove that the projective dimension of any (hyper)graph can be bounded from above by the (Castelnuovo-Mumford) regularity of its Levi graph (or incidence bipartite graph). This in particular brings the use of regularity's upper bounds on…

In this paper we show that the sets of $F$-jumping coefficients of ideals form discrete sets in certain graded $F$-finite rings. We do so by giving a criterion based on linear bounds for the growth of the Castelnuovo-Mumford regularity of…

In this paper we study the Castelnuovo-Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the path ideals of gap free and claw…

Let $G$ be a simple graph on $n$ vertices. We introduce the notion of bipartite connectivity of $G$, denoted by $\operatorname{bc}(G)$ and prove that $$\lim_{s \to \infty} \operatorname{depth} (S/I(G)^{(s)}) \le \operatorname{bc}(G),$$…

In this paper, we initiate a systematic study of generalized binomial edge ideals of whisker graphs by working within a substantially broader class of graphs. We extend the notion of generalized corona products, and through this enlarged…

Let $G$ be a graph and $I=I(G)$ be its edge ideal. When $G$ is the clique sum of two different length odd cycles joined at single vertex then we give an explicit description of the symbolic powers of $I$ and compute the Waldschmidt…

A connected nontrivial graph $G$ is {\it matching covered} if every edge of $G$ is contained in some perfect matching of $G$. A matching covered graph $G$ is {\it minimal} if $G-e$ is not matching covered for each edge $e$ of $G$. A graph…

We develop a multigraded variant of Castelnuovo-Mumford regularity. Motivated by toric geometry, we work with modules over a polynomial ring graded by a finitely generated abelian group. As in the standard graded case, our definition of…

The cut sets of a graph are special sets of vertices whose removal disconnects the graph. They are fundamental in the study of binomial edge ideals, since they encode their minimal primary decomposition. We introduce the class of accessible…

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of…

For a bipartite graph $G$ with parts $X$ and $Y$, an $X$-interval coloring is a proper edge coloring of $G$ by integers such that the colors on the edges incident to any vertex in $X$ form an interval. Denote by $\chi'_{int}(G,X)$ the…

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…

The v-number of a graded ideal is an invariant recently introduced in the context of coding theory, particularly in the study of Reed--Muller-type codes. In this work, we study the localized v-numbers of a binomial edge ideal $J_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…